solution/2200-2299/2225.Find Players With Zero or One Losses/Solution.cpp at main

main

leetcode-chez

397 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.cpp

5 Complexity
5 Complexity / M
0 Duplication
1 Churn
18 Lines
18 Lines of Code
1 Methods
18 LOC / Method

class Solution {
public:
    vector<vector<int>> findWinners(vector<vector<int>>& matches) {
        unordered_map<int, int> cnt;
        for (auto& m : matches) {
            int a = m[0], b = m[1];
            if (!cnt.count(a)) cnt[a] = 0;
            ++cnt[b];
        }
        vector<vector<int>> ans(2);
        for (auto& [u, v] : cnt) {
            if (v < 2) ans[v].push_back(u);
        }
        sort(ans[0].begin(), ans[0].end());
        sort(ans[1].begin(), ans[1].end());
        return ans;
    }
};