LeetCode/solutions/cpp/0229.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        map<int, int> map;
        for (int i = 0; i < nums.size(); i++) map[nums[i]]++;

        vector<int> ans;
        for (auto it = map.begin(); it != map.end(); it++)
            if (it->second > nums.size() / 3)
                ans.push_back(it->first);

        return ans;
    }
};