zoukankan      html  css  js  c++  java
  • js排序--一道js数据结构题

    给一个数组:

    [{ GroupMark: "", GroupName: "hao", SendTime: '123', SendContent: "1ha" },
    { GroupMark: "1", GroupName: "hao", SendTime: '123', SendContent: "2ha" },
    { GroupMark: "1", GroupName: "hao", SendTime: '123', SendContent: "3ha" },
    { GroupMark: "22", GroupName: "hao", SendTime: '123', SendContent: "4ha" },
    { GroupMark: "3", GroupName: "hao", SendTime: '123', SendContent: "6ha" },
    { GroupMark: "22", GroupName: "hao", SendTime: '123', SendContent: "5ha" }]

    目标

    [{"GroupMark":"","GroupName":"hao","SendTime":"123","SendContent":["1ha"]},
    {"GroupMark":"1","GroupName":"hao","SendTime":"123","SendContent":["2ha","3ha"]},
    {"GroupMark":"22","GroupName":"hao","SendTime":"123","SendContent":["4ha","5ha"]},
    {"GroupMark":"3","GroupName":"hao","SendTime":"123","SendContent":["6ha"]}]

    //参照数组去重的
    var
    arr =[{ GroupMark: "", GroupName: "hao", SendTime: '123', SendContent: "1ha" }, { GroupMark: "1", GroupName: "hao", SendTime: '123', SendContent: "2ha" }, { GroupMark: "1", GroupName: "hao", SendTime: '123', SendContent: "3ha" }, { GroupMark: "22", GroupName: "hao", SendTime: '123', SendContent: "4ha" }, { GroupMark: "3", GroupName: "hao", SendTime: '123', SendContent: "6ha" }, { GroupMark: "22", GroupName: "hao", SendTime: '123', SendContent: "5ha" }] var tempObj ={} var resArr = [] for(let [index,item] of arr.entries() ){ let {GroupMark,GroupName,SendContent} = item let keyStr = GroupMark+'&'+GroupName if(tempObj[keyStr]){ let tempSendContent= tempObj[keyStr].SendContent tempObj[keyStr].SendContent=[...tempSendContent,SendContent] }else{ tempObj[keyStr]={ ...item, SendContent:[SendContent] } } } for (let item in tempObj) { resArr.push(tempObj[item]) } console.log(resArr)

  • 相关阅读:
    深度可分离卷积、分组卷积、空洞卷积、转置卷积
    Batch Normalization
    激活函数
    容器————vector
    39XML文档类
    38初识xml
    37QT程序打包
    36可视化操作数据库
    35使用模型操作数据库
    34sqlite
  • 原文地址:https://www.cnblogs.com/forest-king/p/10444051.html
Copyright © 2011-2022 走看看