用js手写数组去重的方法(包含六种方法)

1.用underscore.js lodash.js

2.new Set()
function unique(arr) {
    
    
  return Array.from(new Set(arr));
}
let arr = [1, 2, 3, 3, 1, 3, 4, 2, 5];
console.log([...new Set(arr)]);
console.log(unique(arr));

3.for或arr.forEach遍历数组 + indexOf()方法
function unique(arr) {
    
    
  if (!Array.isArray(arr)) {
    
    
    console.log("type error");
    return;
  }
  var array = [];
  for (let i = 0; i < arr.length; i++) {
    
    
    if (array.indexOf(arr[i]) === -1) {
    
    
      array.push(arr[i]);
    }
  }
  return array;
}
let arr = [1, 2, 3, 3, 1, 3, 4, 2, 5];
console.log(unique(arr));

4.arr.filter()+indexOf()方法
function unique(arr) {
    
    
  return arr.filter(function (item, index, arr) {
    
    
    return arr.indexOf(item, 0) === index;
  });
}
let arr = [1, 2, 3, 3, 1, 3, 4, 2, 5];
console.log(unique(arr));

5.双重for循环
Array.prototype.distinct = function () {
    
    
  for (let i = 0; i < this.length; i++) {
    
    
    for (let j = i + 1; j < this.length; j++) {
    
    
      if (this[i] === this[j]) {
    
    
        this.splice(j, 1);
        j--;
      }
    }
  }
};
let arr = [1, 2, 3, 3, 1, 3, 4, 2, 5];
arr.distinct();
console.log(arr);

6.sort加for循环
function unique(arr) {
    
    
  if (!Array.isArray(arr)) {
    
    
    console.log("type error!");
    return;
  }
  arr.sort();
  var array = [arr[0]];
  for (let i = 1; i < arr.length; i++) {
    
    
    if (arr[i] !== arr[i - 1]) {
    
    
      array.push(arr[i]);
    }
  }
  return array;
}
let arr = [1, 2, 3, 3, 1, 3, 4, 2, 5];
console.log(unique(arr));

おすすめ

転載: blog.csdn.net/weixin_43595755/article/details/118297281