递归算法
function method(arr) {
let res = [];
let toArr = function(arr) {
for (let i = 0; i < arr.length; i++) {
if (arr[i] instanceof Array) {
toArr(arr[i])
} else {
res.push(arr[i])
}
};
};
toArr(arr);
return res
};
数组字符串法
let str = arr + "";
let newArr = str.split(",")
newArr.map(val => {
return parseInt(val)
})
flat函数法
arr.flat()