229. Majority Element II

最新推荐文章于 2023-10-05 14:35:54 发布

CarryPotMan

最新推荐文章于 2023-10-05 14:35:54 发布

阅读量149

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/u012891472/article/details/51518360

版权

算法同时被 2 个专栏收录

73 篇文章 0 订阅

订阅专栏

leetcode

67 篇文章 0 订阅

订阅专栏

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

Hint:
How many majority elements could it possibly have?
Do you have a better hint? Suggest it!

Boyer-Moore Majority Vote algorithm

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        int count1 = 0,count2 = 0, candidate1 = 0,candidate2 = 1;
        vector<int> result;
        for(auto num : nums){
            if(num == candidate1){
                count1++;
            }
            else if(num == candidate2){
                count2++;
            }
            else if(count1 == 0){
                candidate1 = num;
                count1= 1;
            }
            else if(count2 == 0){
                candidate2 = num;
                count2 = 1;
            }
            else{
                count1--;
                count2--;
            }
        }
        count1 = 0;
        count2 = 0;
        for(auto num:nums){
            if(num == candidate1)
                count1++;
            if(num == candidate2)
                count2++;
        }
        if(count1 > nums.size()/3) result.push_back(candidate1);
        if(count2 > nums.size()/3) result.push_back(candidate2);
        return result;
    }
};