【无标题】

数组去重和对象去重的方法


//数组去重的方法
# 方法一
// let array = [“123456”, “256345”, “9589522”, “9628522”, “635241”, “sss”, “123456”, “95121”, “123456”];
// const array = [{name:“1”,id:“1”}, {name:“2”,id:“3”}, {name:“3”,id:“4”}, {name:“2”,id:“3”}, {name:“1”,id:“1”}, {name:“4”,id:“1”}, {name:“5”,id:“1”}];
// const uniqueArray = Array.from(new Set(arr));
// console.log(uniqueArray); // [1, 2, 3, 4, 5]

方法二

    // javascript
    //   const array = [{name:"1",id:"1"}, {name:"2",id:"3"}, {name:"3",id:"4"}, {name:"2",id:"3"}, {name:"1",id:"1"}, {name:"4",id:"1"}, {name:"5",id:"1"}]; 
    //     const uniqueArray = array.reduce((accumulator, currentValue) => {
    //         if (!accumulator.includes(currentValue)) {
    //             accumulator.push(currentValue);
    //         }
    //         return accumulator;
    //     }, []);
    //     console.log(uniqueArray); // [1, 2, 3, 4, 5]

/* */
# 方法三
// const array = [{name:“1”,id:“1”}, {name:“2”,id:“3”}, {name:“3”,id:“4”}, {name:“2”,id:“3”}, {name:“1”,id:“1”}, {name:“4”,id:“1”}, {name:“5”,id:“1”}];
// const uniqueArray = array.filter((value, index, self) => {
// console.log(value, index, self);
// return self.indexOf(value) === index;
// });
// console.log(uniqueArray); // [1, 2, 3, 4, 5]

    //对象去重的方法
 # 方法一
    // const array = [{ name: "1", id: "1" }, { name: "2", id: "3" }, { name: "3", id: "4" }, { name: "2", id: "3" }, { name: "1", id: "1" }, { name: "4", id: "1" }, { name: "5", id: "1" }];
    // const uniqueArray = Array.from(new Set(array.map(JSON.stringify))).map(JSON.parse);
    // console.log(uniqueArray);

方法二

    const array = [{ name: "1", id: "1" }, { name: "2", id: "3" }, { name: "3", id: "4" }, { name: "2", id: "3" }, { name: "1", id: "1" }, { name: "4", id: "1" }, { name: "5", id: "1" }];
    const uniqueArray = array.reduce((accumulator, currentObject) => {
        const hasObject = accumulator.some(obj =>
            obj.id === currentObject.id && obj.name === currentObject.name
        );
        if (!hasObject) {
            accumulator.push(currentObject);
        }
        return accumulator;
    }, []);
    console.log(uniqueArray);
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值