数组里有对象，符合条件数值叠加

Question

目的是要找出results里code相同的数值之和最大的一个，答案是574417bc79df540065d92df7，9+9=18 总和最大。
目前相同的code，poll叠加不知道怎么处理。请大神给个方法
以下obj是这里计算的一个中间产物。
var obj = [{"code":"57442329a3413100625f194f","poll":7},{"code":"5744242bc4c971005d5ff04e","poll":2},{"code":"574417bc79df540065d92df7","poll":18},{"code":"574a841d1532bc006068c6c9","poll":5},{"code":"574a97fe2b51e90056e423c0","poll":12},{"code":"574424e5df0eea0063adefc6","poll":1}] ;

var results = [
    {
        "uid": "5744242bc4c971005d5ff04e",
        "data": [
            {
                "code": "57442329a3413100625f194f",
                "poll": 7
            },
            {
                "code": "5744242bc4c971005d5ff04e",
                "poll": 2
            }
        ]
    },
    {
        "uid": "57442329a3413100625f194f",
        "data": [
            {
                "code": "574417bc79df540065d92df7",
                "poll": 9
            }
        ]
    },
    {
        "uid": "574417bc79df540065d92df7",
        "data": [
            {
                "code": "574417bc79df540065d92df7",
                "poll": 9
            }
        ]
    },
    {
        "uid": "574424e5df0eea0063adefc6",
        "data": [
            {
                "code": "574a841d1532bc006068c6c9",
                "poll": 3
            },
            {
                "code": "574a97fe2b51e90056e423c0",
                "poll": 6
            }
        ]
    },
    {
        "uid": "574a841d1532bc006068c6c9",
        "data": [
            {
                "code": "574424e5df0eea0063adefc6",
                "poll": 1
            },
            {
                "code": "574a841d1532bc006068c6c9",
                "poll": 2
            },
            {
                "code": "574a97fe2b51e90056e423c0",
                "poll": 5
            }
        ]
    },
    {
        "uid": "574a97fe2b51e90056e423c0",
        "data": [
            {
                "code": "574a97fe2b51e90056e423c0",
                "poll": 1
            }
        ]
    }
]
var obj = [];
results.forEach(function(item) {
    item.data.forEach(function(innerItem) {
        if(isIn(innerItem.code, obj)){
            //这里不知如何将相同的code的poll叠加
        }else{
            obj.push({
                code: innerItem.code,
                poll: innerItem.poll
            })
        }
    })
})
console.log(JSON.stringify(obj));

//得出poll数值最大的 code
function size(arr){  
    var win = '';
    var j = arr[0].poll;  
    for (var i=1;i<arr.length ;i++ ){  

        if(arr[i].poll>j){  
            j = arr[i].poll; 
            win =  arr[i].code;
        }  
    }  
    return win;  
}  
size(obj); 

Answer 1

咦，这个我不是给你答过了么？：

修正：

好吧，那我们再来改一次试试：

var res = results
    .reduce(function(p, item) {
        p.push.apply(p, item.data);
        return p;
    }, [])
    .reduce(function(p, item) {
        var filters = p.filter(function(data) {
            return data.code === item.code;
        });
        if (filters.length === 0) {
            p.push(item);
        } else {
            filters[0].poll += item.poll;
        }
        return p;
    }, []);

console.log(res);

var max = res
    .reduce(function(p, item) {
        if (p.poll < item.poll) {
            return item;
        }
        return p;
    }, {poll: 0});

console.log(max); //你想要的结果: { code: '574417bc79df540065d92df7', poll: 18 }

当然我这般似乎不用ES6，真的不怎么简洁

Answer 2

深度固定，属性固定。直接用for扫描一遍不就得了……
ans就是所求。

const map = {};
let max = 0, ans;
for(let i = 0; i < results.length; i++) {
    for(let j = 0; j < results[i].data.length; j++) {
        map[results[i].data[j].code] = map[results[i].data[j].code] ? map[results[i].data[j].code] + results[i].data[j].poll : results[i].data[j].poll;
        if(map[results[i].data[j].code] > max) {
            max = map[results[i].data[j].code];
            ans = results[i].data[j].code;
        }
    }
}

Answer 3

@leftstick 既然res是个数组，用sort就可以

console.log(res.sort(function (cur, next) {
  return cur.poll < next.poll
})[0])
// { code: '574417bc79df540065d92df7', poll: 18 }