第七色在线视频,2021少妇久久久久久久久久,亚洲欧洲精品成人久久av18,亚洲国产精品特色大片观看完整版,孙宇晨将参加特朗普的晚宴

為了賬號(hào)安全，請(qǐng)及時(shí)綁定郵箱和手機(jī)立即綁定
已解決430363個(gè)問(wèn)題，去搜搜看，總會(huì)有你想問(wèn)的

在對(duì)象數(shù)組中找到最常見(jiàn)的項(xiàng)目

在對(duì)象數(shù)組中找到最常見(jiàn)的項(xiàng)目

蕭十郎 2022-12-02 16:02:07
我需要幫助來(lái)創(chuàng)建一個(gè)函數(shù)來(lái)使用 vanilla 或例如 lodash 來(lái)循環(huán)對(duì)象數(shù)組并獲取數(shù)組中出現(xiàn)次數(shù)最多的對(duì)象，這是我的對(duì)象：[{"s":97,"p":75},{"s":99,"p":93},{"s":97,"p":75},{"s":97,"p":76},{"s":97,"p":75},{"s":97,"p":75},{"s":97,"p":74},{"s":86,"p":80},{"s":97,"p":73},{"s":97,"p":71},{"s":97,"p":71}]結(jié)果應(yīng)該是：{"s":97,"p":75}提前致謝
查看完整描述

3 回答

?
慕姐4208626

TA貢獻(xiàn)1852條經(jīng)驗(yàn) 獲得超7個(gè)贊

您可以通過(guò)Array.prototype.reduce()構(gòu)建一個(gè)復(fù)雜的對(duì)象來(lái)遍歷源數(shù)組，以跟蹤每個(gè)對(duì)象的出現(xiàn)、到目前為止最常看到的對(duì)象以及實(shí)際看到最常見(jiàn)對(duì)象的次數(shù)。


所以，一旦一些數(shù)組項(xiàng)超過(guò)maxCount它就變成了mostOften。


這樣你就可以只通過(guò)所有項(xiàng)目來(lái)找到獲勝者：


const src = [{"s":97,"p":75},{"s":99,"p":93},{"s":97,"p":75},{"s":97,"p":76},{"s":97,"p":75},{"s":97,"p":75},{"s":97,"p":74},{"s":86,"p":80},{"s":97,"p":73},{"s":97,"p":71},{"s":97,"p":71}],


      {mostOften} = src.reduce((r,{s,p}) => {

        const hash = s+'\ud8ff'+p

        r.hashCount[hash] = (r.hashCount[hash]||0) + 1

        r.hashCount[hash] > r.maxCount &&

        (r.mostOften = {s,p}, r.maxCount = r.hashCount[hash])

        return r

      }, {hashCount: {}, mostOften: null, maxCount: 0})

      

console.log(mostOften)      

      


查看完整回答
反對(duì) 回復(fù) 2022-12-02
?
慕碼人2483693

TA貢獻(xiàn)1860條經(jīng)驗(yàn) 獲得超9個(gè)贊

這里重要的是為您認(rèn)為“相同”的對(duì)象提供可靠的密鑰。我會(huì)建議JSON.stringify由兩個(gè)屬性組成的數(shù)組：


let data = [{"s":97,"p":75},{"s":99,"p":93},{"s":97,"p":75},{"s":97,"p":76},{"s":97,"p":75},{"s":97,"p":75},{"s":97,"p":74},{"s":86,"p":80},{"s":97,"p":73},{"s":97,"p":71},{"s":97,"p":71}];


let keys = Object.fromEntries(data.map(o => [ JSON.stringify([o.s, o.p, "s" in o, "p" in o]), o ]));

let counter = {};

for (let key in keys) counter[key] = (counter[key] || 0) + 1;

let bestKey = Object.entries(counter).reduce((max, [key, count]) =>

    count > max[1] ? [key, count] : max, ["", 0])[0];

    

let result = keys[bestKey];

console.log(result);

即使s或p是帶有任何外來(lái)字符的字符串，或布爾值，或null, 或原語(yǔ)（的數(shù)組）數(shù)組，......這仍然有效。



查看完整回答
反對(duì) 回復(fù) 2022-12-02
?
森林海

TA貢獻(xiàn)2011條經(jīng)驗(yàn) 獲得超2個(gè)贊

let arr = [{"s":97,"p":75},{"s":99,"p":93},{"s":97,"p":75},{"s":97,"p":76},{"s":97,"p":75},{"s":97,"p":75},{"s":97,"p":74},{"s":86,"p":80},{"s":97,"p":73},{"s":97,"p":71},{"s":97,"p":71}]

let obj = {};

let maxCount = 0;

let result;

arr.forEach(e => {

  let key = `s:${e.s}:p:${e.p}`;

  obj[key] = obj[key] || 0;

  obj[key] += 1;

  if(obj[key] > maxCount){

    maxCount = obj[key];

    result = e;

  }

});

console.log(result);


查看完整回答
反對(duì) 回復(fù) 2022-12-02
  • 3 回答
  • 0 關(guān)注
  • 142 瀏覽
慕課專欄
更多

添加回答

舉報(bào)

0/150
提交
取消
微信客服

購(gòu)課補(bǔ)貼
聯(lián)系客服咨詢優(yōu)惠詳情

 幫助反饋 APP下載

慕課網(wǎng)APP
您的移動(dòng)學(xué)習(xí)伙伴

 公眾號(hào)

掃描二維碼
關(guān)注慕課網(wǎng)微信公眾號(hào)