数组扁平化(递归实现)

224 阅读1分钟
var arr = [1, 2, 3, [4, 5, 6,[7,8,9]],10];
function bianping(arr) {
    let newArr = [];
    // 循环遍历
  for (let i = 0; i < arr.length; i++) {
    if (typeof arr[i] != "object") {
        // 添加到新数组
      newArr.push(arr[i]);
    } else {
        // 递归调用
      bianping(arr[i]);
    }
  }
    return newArr;
}
console.log(bianping(arr));// =>[1, 2, 3, 4, 5, 6,7,8,9,10]