思路:把所有数组合并成一个数组,然后再遍历找到重复的 元素
var a = [1,2,3,4,9];
var b = [8,0,2,3,4];
var c = [1,3,4];
var num = 3;
function mergeArr(num, ...arr){
let tmpA = arr.reduce((lastArr, item)=>{
lastArr = lastArr.concat(item);
return lastArr;
},[])
console.log(tmpA)
return qujiao(tmpA,num);
}
function qujiao(arrs, num) {
let jiao = [];
let obj = arrs.reduce((last, item) =>{
if(!last[item]){
last[item] = 1;
}else{
last[item] = last[item] + 1;
}
return last;
},{})
for(key in obj){
if(obj[key] == num){
jiao.push(key);
}
}
return jiao;
}
mergeArr(num,a,b,c);