function searchMinArr(arrList) {
minArr = arrList[0];
arrList.forEach(i=>{ //找出长度最小的数组
if(i.length<minArr.length){
minArr = i;
}
})
let targetArr = []
for (let i = 0; i < minArr.length; i++) {
let stutas = true
for (let j = 0; j < arrList.length; j++) {
if(!arrList[j].includes(minArr[i])) {
stutas = false
break
}
}
stutas && !targetArr.includes(minArr[i]) && targetArr.push(minArr[i])
}
return targetArr
}
let arr = [[3,4,6],[4,5],[1,2,3,4]]
searchMinArr(arr) //[4]