参考https://github.com/mqyqingfeng/Blog/issues/27
双层循环
let arr = [1, 2, '1', 3, 2];
// 双重循环
let arr1 = []
for (let i = 0; i < arr.length; i++) {
for (var j = 0; j < arr.length; j++) {
if(arr[i] === arr1[j]){
break;
}
}
if (j === arr.length) {
arr1.push(arr[i]);
}
}
indexof
for (let i = 0; i < arr.length; i++) {
if (arr1.indexOf(arr[i]) == -1) {
arr1.push(arr[i])
}
}
排序后去重
let arr2 = arr.sort();
for (let i = 0; i < arr.length; i++) {
if (arr2[i]!==arr2[i+1]) {
arr1.push(arr2[i])
}
}
filter
arr1 = arr.filter((item, index, arr) => {
return arr.indexOf(item) === index;
})
arr1 = arr.sort().filter((item, index, arr) => {
return !index || item !== arr[index - 1];
})
object
let obj = {};
arr1 = arr.filter((item, index, arr) => {
return obj.hasOwnProperty(typeof item + JSON.stringify(item)) ? false : obj[typeof item + JSON.stringify(item)] = true;
})
es6
arr1 = Array.from(new Set(arr));
arr1 = [... new Set(arr)];
let map = new Map();
arr1 = arr.filter(item => {
return map.has(item) ? false : map.set(item, 1)
})
方法 | 结果 | 说明 |
---|---|---|
for循环 | [1, “1”, null, undefined, String, String, /a/, /a/, NaN, NaN] | 对象和 NaN 不去重 |
indexOf | [1, “1”, null, undefined, String, String, /a/, /a/, NaN, NaN] | 对象和 NaN 不去重 |
sort | [/a/, /a/, “1”, 1, String, 1, String, NaN, NaN, null, undefined] | 对象和 NaN 不去重 数字 1 也不去重 |
filter + indexOf | [1, “1”, null, undefined, String, String, /a/, /a/] | 对象不去重 NaN 会被忽略掉 |
filter + sort | [/a/, /a/, “1”, 1, String, 1, String, NaN, NaN, null, undefined] | 对象和 NaN 不去重 数字 1 不去重 |
优化后的键值对方法 | [1, “1”, null, undefined, String, /a/, NaN] | 全部去重 |
Set | [1, “1”, null, undefined, String, String, /a/, /a/, NaN] |