数组去重的几种方法(不定期更新)

1.sort排序比较

var a = [1,2,5,6,2,1,0,2,8,4,56,4,65,4];
var n = [];
var s = a.sort(function(a,b){
	return a - b;
})
function cz(num){
	if(num < s.length){
		if(s[num] !== s[num+1]){
			n.push(s[num]);
		}
		arguments.callee(num+1);
	}
}
cz(0);
console.log(n)			// [0, 1, 2, 4, 5, 6, 8, 56, 65]

2.indexOf

var arr = ["hehe","haha","heihei","haha","oo","hehe","haha"];
var arr2 = [];
function strCz(num2){
	if(num2 <= arr.length-1){
		if(arr2.indexOf(arr[num2]) === -1){
			arr2.push(arr[num2]);
		}
		arguments.callee(num2+1);
	}
	
}
strCz(0)
console.log(arr2);		//  ["hehe", "haha", "heihei", "oo"]

3.双重for循环

var tm = ["sd","asdas","sd",1,2,3,4,5,51,13,2,3,1,2];
var tm2 = [];
for(var i=0; i<tm.length; i++){
    for(var j=i+1; j<tm.length; j++){
        if(tm[i] == tm[j]){
            i++;
            j=i;
        }
    }
    tm2.push(tm[i]);
}
console.log(tm2);        // ["asdas", "sd", 4, 5, 51, 13, 3, 1, 2]

4.splice

//splice 数组去重
var ars = ["asdas","s","asda","asda","asda",1,2,3,4,5,3,2,1];
for(var i=0; i<ars.length; i++){
	for(var j=i+1; j<ars.length; j++){
		if(ars[i] == ars[j]){
			ars.splice(j,1);
			j--;
		}	
	}
}
console.log(ars)

5.for…of + includes()

/** for...of + includes()去重 */
removeDuplication (arrayA, arrayB) {
  let arrNew = arrayA.concat(arrayB)
  let result = []
  for (let i of arrNew) {
    !result.includes(i) && result.push(i)
  }
  return result
}

6.Array.filter() + indexOf

/** Array.filter() + indexOf() */
removeDuplication (arrayA, arrayB) {
  let arrNew = arrayA.concat(arrayB)
  return arrNew.filter((item, index) => {
    return arrNew.indexOf(item) === index
  })
}

7.Array.from() + new Set()

/** Array.from() + new Set() */
removeDuplication (arrayA, arrayB) {
  return Array.from(new Set([...arrayA, ...arrayB]))
}

另一种用法;

function unique(arr){
    return Array.from(new Set(arr))
}
var arr = [1,2,3,4,1,2,3,4];
unique(arr)
//(4) [1, 2, 3, 4]

8.for…of + Object

/** for...of + Object */
removeDuplication (arrayA, arrayB) {
  let arrNew = arrayA.concat(arrayB)
  let result = []
  let obj = {}
  for (let i of arrNew) {
    if (!obj[i]) {
      result.push(i)
      // 利用对象key值唯一特性
      obj[i] = 1
    }
  }
  return result
}

9.reduce

<script>
    function getNewArr(arr){
       //reduce
       return arr.reduce((pre,next)=>{
        return  pre.includes(next)?pre:[...pre,next]
       },[])
    }
    console.log(getNewArr([1,4,5,7,3,4,1,0,5,6,5,3,1]))
</script>

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值