10种去重方法

最新推荐文章于 2022-02-04 09:44:18 发布

是小李啊

最新推荐文章于 2022-02-04 09:44:18 发布

阅读量557

点赞数

文章标签： javascript 前端 typescript

本文链接：https://blog.csdn.net/lj971005/article/details/122040377

版权

去重

Set去重

// 需要注意Set过后的变化
function unique(arr) {
return Array.from(new Set(arr))
 }
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];console.log(unique(arr)) 
// [1, "true", true, 15, false, undefined, null, NaN, "NaN", 0, "a", {}, {}]

双重for循环+splice去重

function unique(arr) {
  for (var i = 0; i < arr.length; i++) {
    for (var j = i + 1; j < arr.length; j++) {
      //第一个等同于第二个，splice方法删除第二个
      if (arr[i] == arr[j]) { 
        arr.splice(j, 1);
        j--;
      }
    }
  }
  return arr;
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) // [1, "true", 15, false, undefined, NaN, NaN, "NaN", "a", {}, {}]

indexOf去重

function unique(arr) {
 if (!Array.isArray(arr)) {
   console.log('type error!')
   return
 }
 var array = [];
 for (var i = 0; i < arr.length; i++) {
   if (array.indexOf(arr[i]) === -1) {
     array.push(arr[i])
   }
 }
 return array;
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) // [1, "true", true, 15, false, undefined, null, NaN, NaN, "NaN", 0, "a", {…}, {…}]  // NaN、{}没有去重

sort去重

 function unique(arr) {
   if (!Array.isArray(arr)) {
     console.log('type error!')
     return;
   }
   arr = arr.sort()
   var arrry = [arr[0]];
   for (var i = 1; i < arr.length; i++) {
     if (arr[i] !== arr[i - 1]) {
       arrry.push(arr[i]);
     }
   }
   return arrry;
 }
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) // [0, 1, 15, "NaN", NaN, NaN, {…}, {…}, "a", false, null, true, "true", undefined]  // NaN、{}没有去重

includes去重

 function unique(arr) {
   if (!Array.isArray(arr)) {
     console.log('type error!')
     return
   }
   var array = [];
   for (var i = 0; i < arr.length; i++) {
     if (!array.includes(arr[i])) { //includes 检测数组是否有某个值
       array.push(arr[i]);
     }
   }
   return array
 }
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) //[1, "true", true, 15, false, undefined, null, NaN, "NaN", 0, "a", {…}, {…}]     //{}没有去重

hasOwnProperty去重

function unique(arr) {
 var obj = {};
  return arr.filter(function (item, index, arr) {
    return obj.hasOwnProperty(typeof item + item) ? false : (obj[typeof item + item] = true)
  })
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
let arr1 = [{
  groupId: '201393',
  groupTitle: "1",
  imgList: [{
    id: 1
  }]
}, {
  groupId: '201393',
  groupTitle: "1",
  imgList: [{
    id: 1
  }]
}, {
  groupId: '201393',
  groupTitle: "1",
  imgList: [{
    id: 1
  }]
}]
console.log(unique(arr)) //[1, "true", true, 15, false, undefined, null, NaN, "NaN", 0, "a", {}]   //所有的都去重了
console.log(unique(arr1)) // [{groupId: '201393',groupTitle: "1",imgList: [{ id: 1 }]}]

filter去重

function unique(arr) {
 return arr.filter(function (item, index, arr) {
   //当前元素，在原始数组中的第一个索引==当前索引值，否则返回当前元素
   return arr.indexOf(item, 0) === index;
 });
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) //[1, "true", true, 15, false, undefined, null, "NaN", 0, "a", {…}, {…}]

递归去重

function unique(arr) {
 var array = arr;
 var len = array.length;

 array.sort(function (a, b) { //排序后更加方便去重
   return a - b;
 })
 function loop(index) {
   if (index >= 1) {
     if (array[index] === array[index - 1]) {
       array.splice(index, 1);
     }
     loop(index - 1); //递归loop，然后数组去重
   }
 }
 loop(len - 1);
 return array;
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)) // [1, "a", "true", true, 15, false, 1, {…}, null, NaN, NaN, "NaN", 0, "a", {…}, undefined]

利用Map数据结构去重

function arrayNonRepeatfy(arr) {
  let map = new Map();
   let array = new Array(); // 数组用于返回结果
   for (let i = 0; i < arr.length; i++) {
     if (map.has(arr[i])) { // 如果有该key值
       map.set(arr[i], true);
     } else {
       map.set(arr[i], false); // 如果没有该key值
       array.push(arr[i]);
     }
   }
   return array;
 }
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(arrayNonRepeatfy(arr)) //[1, 'true', true, 15, false, undefined, null, NaN, 'NaN', 0, 'a',{},{}]

reduce+includes

function unique(arr) {
  return arr.reduce((prev, cur) => prev.includes(cur) ? prev : [...prev, cur], []);
}
var arr = [1, 1, 'true', 'true', true, true, 15, 15, false, false, undefined, undefined, null, null, NaN, NaN, 'NaN', 0, 0, 'a', 'a', {}, {}];
console.log(unique(arr)); // [1, 'true', true, 15, false, undefined, null, NaN, 'NaN', 0, 'a',{},{}]