let a = [[1,2,3],[4],[5,6,[7,[8]]]];
let result = [];
let hash = {};
function flat(arr){
for(let i = 0'i<arr.length;i++){
if(typeof arr[i] == 'number') {
if(result.indexOf(arr[i])==-1)result.push(arr[i]);//去重
if(!hash[arr[i]]){hash[arr[i]] = 1;result.push(arr[i])}//另一种去重方式
}
else flat(arr[i]);
}
}
flat(a);
console.log(result);//[1, 2, 3, 4, 5, 6, 7, 8]
indexOf:如果result里面出现过则返回值不为-1
hash:哈希表,如果没有存过哈希表就存哈希表并将结果放入最终数组
hash的效率更高!
排序的话可以用快排:
funciton quickSort(arr){
if(arr.length == 1)return arr;
let left = [];
let right = [];
let pivotIndex = Math.floor(arr.length/2);
let pivot = arr.splice(pivotIndex,1)[0];
for(let i = 0;i<arr.length;i++){
if(arr[i]<pivot)left.push(arr[i])
else right.push(arr[i]);
}
return quickSort(left).concat([pivot],quickSort(right));
}