229. 求众数 II

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        int n = nums.size();
        int element1 = 0, element2 = 0;
        int vote1 = 0, vote2 = 0;
        vector<int> ans;
        for(int num : nums){
            //元素1重复出现，次数++
            if(vote1 > 0 && num == element1)
                vote1++;
            //元素2重复出现，次数++
            else if(vote2 > 0 && num == element2)
                vote2++;
            //元素1抵消完了，重新选择元素1
            else if(vote1 == 0){
                element1 = num;
                vote1++;
            }
            //元素2抵消完了，重新选择元素2
            else if(vote2 == 0){
                element2 = num;
                vote2++;
            }
            //num不同于元素1和元素2，次数抵消
            else{
                vote1--;
                vote2--;
            }
        }
        //重新计算出现的次数
        vote1 = 0;
        vote2 = 0;
        for(int num : nums){
            if(num == element1)
                vote1++;
            else if(num == element2)
                vote2++;
        }
        //如果次数 > n / 3，满足题意，加入ans
        if(vote1 > n / 3)
            ans.push_back(element1);
        if(vote2 > n / 3)
            ans.push_back(element2);
        return ans;
    }
};

Accepted
82/82 cases passed (8 ms)
Your runtime beats 89.9 % of cpp submissions
Your memory usage beats 73.76 % of cpp submissions (15.4 MB)