1.双重循环找到重复的元素并删除
let arr = [1, 2, 6, 3, 7, 3, 2, 8, 9, 1, 5]
function unique(arr) {
for (var i = 0, len = arr.length
for (var j = i + 1, len = arr.length
if (arr[i] === arr[j]) {
arr.splice(j, 1)
j--
len--
}
}
}
return arr
}
console.log(unique(arr))
2.ES6的新特性使用Set的特性
var arr = [1, 2, 6, 3, 7, 3, 2, 8, 9, 1, 5];
function unique(arr) {
return Array.from(new Set(arr))
}
console.log(unique(arr));
//console.log(...new Set(arr));
3.利用数组的includes去重
var arr = [1, 2, 6, 3, 7, 3, 2, 8, 9, 1, 5]
function unique( arr ){
var arr1 = []
for(var i=0,len=arr.length
if( !arr1.includes( arr[i] ) ){
arr1.push(arr[i])
}
}
return arr1
}
console.log(unique(arr))
4.indexOf()去重
let arr = [1, 2, 3, 1, 5, 6, 3, 6]
function unique(arr) {
let newArr = []
for (let i = 0
if (newArr.indexOf(arr[i]) == -1) {
newArr.push(arr[i])
}
}
return newArr
}
console.log(unique(arr))