Leetcode-229

Majority Element II

 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>

class Solution {
public:
    std::vector<int> majorityElement(std::vector<int>& nums) {
        int num1, num2;
        int cnt1 = 0, cnt2 = 0;
        for (auto& n : nums) {
            if (cnt1 == 0) {
                num1 = n;
                cnt1 = 1;
            }
            else if (num1 == n) {
                ++cnt1;
            }
            else if (cnt2 == 0) {
                num2 = n;
                cnt2 = 1;
            }
            else if (num2 == n) {
                ++cnt2;
            }
            else {
                --cnt1;
                --cnt2;
                if (cnt1 == 0) {
                    std::swap(cnt1, cnt2);
                    std::swap(num1, num2);
                }
            }
        }
        
        cnt1 = cnt2 = 0;
        for (auto& n : nums) {
            if (n == num1) {
                ++cnt1;
            }
            else if (n == num2) {
                ++cnt2;
            }
        }
        
        int n = nums.size() / 3;
        std::vector<int> res;
        if (cnt1 > n) {
            res.push_back(num1);
        }
        if (cnt2 > n) {
            res.push_back(num2);
        }
        
        return res;
    }
};

Leetcode-229