数组扁平化

递归

循环判断数组内是否嵌套数组，如果True，进行递归，得到返回值，如果False,则push

let arr = [1, [2, [3, 4]]];
function flattern(arr) {
  let result = [];
  for(let i = 0; i < arr.length; i++) {
    if(Array.isArray(arr[i])) {
      result = result.concat(flattern(arr[i]))
    }else {
      result.push(arr[i])
    }
  }
    return result;
}

console.log(flattern(arr));

split&& toString || join

let arr = [1,3,[9,7]];
console.log(arr.toString().split(","))
//["1","3","9","7"]
console.log(arr.toString().split(",").map(function(item){ return parseInt(item) }))
//[1,3,9,7]

let arr = [1,3,[9,9,[16]]];
console.log(arr.join(",").split(","))
//[1,3,9,9,16]

扩展运算符+concat

二维数组扁平化

let arr = [1,5,9,[8,10]];
console.log([].concat(...arr))

reduce

let arr = [1,5,5,10,16,30,[1,4,9]];
function flatern(arr) {
  return arr.reduce((prev,curv)=> {
    return prev.concat(Array.isArray(curv)?flatern(curv):curv)
  },[])
}
console.log(flatern(arr));

flat

let arr = [5,10,6,[9,10,[2]]];
let testArr = arr.flat(Infinity);console.log(testArr)