【Daily Code】leetcode 2225. 找出输掉零场或一场比赛的玩家

Problem: 2225. 找出输掉零场或一场比赛的玩家

Code

class Solution {
public:
    vector<vector<int>> findWinners(vector<vector<int>>& matches) {
        vector<vector<int>> res(2);
        map<int, int> cnt;
        for(auto x : matches) {
            cnt[x[0]] += 0;
            cnt[x[1]] ++;
        }
        for(map<int,int>::iterator it=cnt.begin();it != cnt.end();it ++)
        {
            if(it->second == 0) res[0].push_back(it->first);
            else if(it->second == 1) res[1].push_back(it->first);
        }
        return res;
    }
};