JS去重ES6方法

<script>

// JS去重ES6方法

let arr = [0,0,0,1,1,2,3,5,9,6,5,4,10];

// 数组去重法1

let newarr = []; //定义一个空数组

for (var i = 0;i < arr.length;i++) { //先遍历

if(newarr.indexOf(arr[i]) == -1){ //indexOf=-1,说明在newarr这个新数组里面没有找到这个字符，就将没有找到得字符放到这个newarr

//新数组中。默认的不是首次出现在newarr中的字符将不会被push到newarr中，实现了去重

newarr.push(arr[i]);

};

};

console.log(newarr);

???// 数组去重法2

???let newarr2 = []; ?//定义一个空数组

???arr.sort(); ???//先将数组排序

???for(var i = 0;i < arr.length; i++) {

???????if(arr[i] !== arr[i+1]) { ??//判断后一项 是否跟前一项一样，将后一项放入新数组

???????newarr2.push(arr[i]);

???????}

???}

???console.log(newarr2);

???// 数组去重法2

???var res = [arr[0]];

???for(var i = 0;i < arr.length;i++) {

???????var repeat = false;

???????for(var j = 0;j < res.length;j++) {

???????????if (arr[i] == res[j]) {

???????????????repeat = true;

???????????????break;

???????????}

???????}

???????if(!repeat) {

???????????res.push(arr[i]);

???????}

???}

???console.log(res)

???</script>