Leetcode 229. Majority Element II

最新推荐文章于 2023-11-14 16:58:03 发布

SnailTyan

最新推荐文章于 2023-11-14 16:58:03 发布

阅读量379

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/82693040

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Majority Element II

2. Solution

Version 1

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        int limit = nums.size() / 3;
        vector<int> result;
        unordered_map<int, int> m;
        for(int num : nums) {
            m[num]++;
            if(m[num] > limit) {
                m[num] = INT_MIN;
                result.push_back(num);
            }
        }
        return result;
    }
};

Version 2

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