总结两种方法:
1. 最简单数组去重法,新建一新数组,遍历传入数组,值不在新数组就push进该新数组中,IE8以下不支持数组的indexOf方法
function uniq(arr){
var tem=[];
for(var i=0;i<arr.length;i++){
if(tem.indexOf(arr[i])==-1){
tem.push(arr[i])
}
}
return tem;
}
var ff=[1,2,2,"e","r",5,6,8,5,"e"]
console.log(uniq(ff));
2.先sort排序,新建一个数组,再将后一个和前一个作比较,值不同的,就push进新数组(会改变数组顺序)
function uniq (arr) {
arr.sort()
var tem = [arr[0]]
for (var i = 1; i < arr.length; i++) {
if (arr[i] !== tem[tem.length - 1]) {
tem.push(arr[i])
}
}
return tem
}
var ff = [1, 2, 2, 'e', 'r', 5, 6, 8, 5, 'e']
console.log(uniq(ff));
ES6 数组去重
let newArr = Array.from(new Set([1, 2, 3, 4, 4]))
console.log(newArr)