MyLeetcode/cpp_solutions/229.cpp at main · Kaminyou/MyLeetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        int count1 = 0;
        int count2 = 0;
        int element1 = INT_MIN;
        int element2 = INT_MIN;
        for (auto num : nums) {
            if (num == element1) {
                count1++;
            }
            else if (num == element2) {
                count2++;
            }
            else if (count1 == 0) {
                element1 = num;
                count1++;
            }
            else if (count2 == 0) {
                element2 = num;
                count2++;
            }
            else {
                count1--;
                count2--;
            }
        }

        count1 = count2 = 0;
        for (auto num : nums) {
            if (num == element1) count1++;
            if (num == element2) count2++;
        }
        vector<int> res;
        if (count1 > nums.size() / 3) res.push_back(element1);
        if (count2 > nums.size() / 3) res.push_back(element2);
        return res;
    }
};