Javascript实现数组的查重

数组的查重

法1：

let arr = [1,2,3,1,1,2,3,2,3,2,1,1,2,3,1,1,2];
let temp,index,sum;
for(let i=0;i<arr.length;){
    // console.log(arr[i]);
    temp = arr.indexOf(arr[i]);
    // console.log(temp);
    index = arr.lastIndexOf(arr[i]);
    // console.log(index);
    if(temp != index){
        arr.splice(index,1); 
    }
    else{
        i++;
    }
    
}
console.log(arr);

法2：

let arr = [1,2,3,1,1,2,3,2,3,2,1,1,2,3,1,1,2];
let temp,index,sum;
for(let i=0;i<arr.length;i++){
    // console.log(arr[i]);
    temp = arr.indexOf(arr[i]);
    // console.log(temp);
    index = arr.lastIndexOf(arr[i]);
    // console.log(index);
    if(temp != index){
        arr.splice(index,1);
        i--; 
    }
}
console.log(arr);