面试遇到的手撕题（持续更）

1. 数组去重

var arr = [3, 1, 2, 4, 5, 1, 2, 3]
方法一：
let res = new Set(arr);
// console.log([...res]);
console.log(Array.from(res));

方法2：
let  n = arr.length;
for (let i = 0; i < n; i++) {
	for (let j = i + 1; j < n; j++) {
		if (arr[i] == arr[j]) {
			arr.splice(j, 1);
			n--;
		}
	}
}
console.log(arr);

方法3：
arr.sort((a, b) => a - b);
let res = [];
res.push(arr[0]);
for (let i = 1; i < arr.length; i++) {
	if (arr[i] !== arr[i - 1]) {
		res.push(arr[i]);
	}
}
console.log(res);

方法4：let res = [];
for (let i = 0; i < arr.length; i++) {
	if (!res.includes(arr[i])) {
		res.push(arr[i]);
	}
}
console.log(res);

2. 多维数组扁平化

var arr = [1, 2, [[3,4], 5], 6, [7, [8, 9]]]

方法1：flat
let res = arr.flat(Infinity);
console.log(res);

方法2：reduce
const flatten = arr => {
	return arr.reduce((pre, cur) => {
		return pre.concat(Array.isArray(cur) ? flatten(cur) : cur)
	}, [])
}

console.log(flatten(arr));

方法3：Map
const flatten = arr => {
	return [].concat(...arr.map(x => Array.isArray(x) ? flatten(x) : x))
}

console.log(flatten(arr));
考虑flat第二个参数：
var flatten = function(arr, num) {
    return [].concat(...arr.map(cur => Array.isArray(cur) && num !== 0 ? flatten(cur, --num) : cur));
}

方法4：函数递归
let res = [];
const flatten = arr => {
	for (let i = 0; i < arr.length; i++) {
		if (Array.isArray(arr[i])) {
			flatten(arr[i]);
		} else {
			res.push(arr[i]);
		}
	}
}

flatten(arr);
console.log(res);