数组去重

最新推荐文章于 2023-02-13 17:50:00 发布

置顶好漂亮

最新推荐文章于 2023-02-13 17:50:00 发布

阅读量194

点赞数 1

分类专栏：前端文章标签： javascript

本文链接：https://blog.csdn.net/hyh0327/article/details/105653229

版权

前端专栏收录该内容

2 篇文章 0 订阅

订阅专栏


function one(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
    var newArr = [];
   arr.map(item=>{
        if(!newArr.includes(item)){
            newArr.push(item)
        }
    });
    return newArr;
}
console.log(one())


function two(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
   const set = new Set(arr);
   return Array.from(set);
}

console.log(two())



function three(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
    return arr.filter(function(item, index, arr) {
        //当前元素，在原始数组中的第一个索引==当前索引值，否则返回当前元素
        return arr.indexOf(item, 0) === index;
      });
 }
 
 console.log(three())


 function four(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
     return arr.sort().reduce((init,cur)=>{
       if(init.length === 0 || init[init.length-1]!== cur){
           init.push(cur);
       }
     },0);
 }

 console.log(four())

function five(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
    return  arr.reduce((accumulator, current) => {
        return accumulator.includes(current) ? accumulator : accumulator.concat(current);
    }, []);
}

console.log(five())


function six(){
    var arr = [1,12,122,12,12,13,93,87,78,92,93];
   for(var i = 0;i<arr.length;i++){
      for(var j = i+1;j<arr.length;j++){
          if(arr[i] === arr[j]){
              arr.splice(j,1);
              j--;
          }
      }
   }
   return arr;
}


console.log(six())