function overMaxStrLen(arr1,arr2){
var comNum = 0;
if(!arr1 || !arr2){
return comNum;
}
var len1 = arr1.length;
var len2 = arr2.length;
var minArr = arr1;
var maxArr = arr2;
if(len1 > len2){
minArr = arr2;
maxArr = arr1;
}
var minStr = minArr.join("");
var maxStr = maxArr.join("");
var minLen = minStr.length;
while(minLen > 0){
if(maxStr.indexOf(minStr[minLen -1]) != -1){
comNum +=1;
}
minLen -=1;
}
return comNum;
}
//将数组arr去重
function remoceRepeat( arr){
arr.sort(); //先排序
var res = [arr[0]];
for(var i = 1; i < arr.length; i++){
if(arr[i] !== res[res.length - 1]){
res.push(arr[i]);
}
}
return res;
}
var comNum = 0;
if(!arr1 || !arr2){
return comNum;
}
var len1 = arr1.length;
var len2 = arr2.length;
var minArr = arr1;
var maxArr = arr2;
if(len1 > len2){
minArr = arr2;
maxArr = arr1;
}
var minStr = minArr.join("");
var maxStr = maxArr.join("");
var minLen = minStr.length;
while(minLen > 0){
if(maxStr.indexOf(minStr[minLen -1]) != -1){
comNum +=1;
}
minLen -=1;
}
return comNum;
}
//将数组arr去重
function remoceRepeat( arr){
arr.sort(); //先排序
var res = [arr[0]];
for(var i = 1; i < arr.length; i++){
if(arr[i] !== res[res.length - 1]){
res.push(arr[i]);
}
}
return res;
}
本文介绍了一种比较两个字符串数组并找出共同字符数量的方法,同时提供了一个实用的数组去重函数。通过这些函数,可以有效地处理字符串和数组操作中的常见问题。
623

被折叠的 条评论
为什么被折叠?



