数组去重方法

---

提示：最近做数组去重遇到些问题，这里简单记录一下

---

一、常见数组去重

1.遍历数组法

var arr = [2, 8, 5, 0, 5, 2, 6, 7, 2]
var newArr = []
for (var i = 0; i < arr.length; i++) {
	//indexOf() 方法可返回某个指定的字符串值在字符串中首次出现的位置
    if (newArr.indexOf(arr[i]) == -1) {
    	//数组中没找到字符串则返回 -1，push到新数组里
        newArr.push(arr[i])
    }
}
console.log(newArr) // 结果：[2, 8, 5, 0, 6, 7]

2.双重循环去重

var arr=["你","我","他","她","他"]
var newArr=[]
newArr[0]=arr[0]
for(let i=0;i<arr.length;i++){
	for(let j=0;j<newArr.length;j++){
		//原数组的值等于新数组的值，跳出循环
		if(newArr[j]==arr[i]) break
    	//原数组中的某个元素比到新数组最后一个都还没有重复，则push到新数组
    	if(j==newArr.length-1) newArr.push(arr[i])
     }
 }
console.log(newArr)	//结果：["你","我","他","她"]

3.Set去重(ES6)

var arr = [2, 8, 5, 0, 5, 2, 6, 7, 2]
var newArr=[...new Set(arr)]
console.log(newArr)	//结果：[2, 8, 5, 0, 6, 7]

二、json数组去重

let mode=[
	{
    	name:"1",
        code:111
    },{
        name:"2",
        code:222
    },{
        name:"3",
        code:333
    },{
        name:"2",
        code:222
    }]
for(let j=0;j<mode.length;j++){
	for(let k=j+1;k<mode.length;){
		//判断条件根据个人需求确定
        if(mode[j].name==mode[k].name && mode[j].code==mode[k].code){
			//如果第一个等于第二个，splice方法删除第二个,数组长度减一
            mode.splice(k,1)
        }
        else k++;
    }
}
console.log(mode)	//结果：[{name:"1",code:111},{name:"2",code:222},{name:"3",code:333}]