6种数组去重方法

filter方法

var r = [];
var arr = ['apple', 'strawberry', 'banana', 'pear', 'apple', 'orange', 'orange', 'strawberry'];
r = arr.filter(function (element, index, self) {
    return self.indexOf(element) === index;
});
console.log(r);

map方法

var myarr = [1, 2, 3, 3, 7, 4, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9];
var r = [];
myarr.map(function(value,index,arr){
    if(arr.indexOf(value) == index){
        r.push(value);
    }
    return;
}); 
console.log(r)

reduce方法

let arr = [1, 2, 2, 3, 4, 5, 5, 5, 1, 2, 3, 4];
let r = [];
arr.reduce((r, value) => {
    if(!r.includes(value)){
        r.push(value);
    }
    return r;
}, r);
console.log(r);

ES6 Set数组去重

let arr = [1, 1, 6, 6, 4, 4, 3, 2, 2, 3, 4, 5, 5, 5];
let r = [...new Set(arr)];
console.log(r);

for循环数组去重

var arr = [1,2,2,4,9,6,7,5,2,3,5,6,5];
var r = []; 
for(var i = 0; i < arr.length; i++){
    if(r.indexOf(arr[i]) == -1){
        r.push(arr[i]);
    }
}
console.log(r);

for循环嵌套

var arr = [ 1, 2, 2, 4, 9, 6, 7, 5, 2, 3, 5, 6, 5, 9];
for(var i = 0; i < arr.length; i++){
    for(var j = i + 1; j < arr.length; j++){
        if(arr[i] == arr[j]){         
            arr.splice(j,1);
            j--;
        }
    }
}
console.log(arr)