***Leetcode 229. Majority Element II

最新推荐文章于 2021-10-23 01:41:57 发布

Z-Pilgrim

最新推荐文章于 2021-10-23 01:41:57 发布

阅读量120

点赞数

分类专栏： LeetCode题解

本文链接：https://blog.csdn.net/u011026968/article/details/81008550

版权

LeetCode题解专栏收录该内容

271 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/majority-element-ii/description/

https://www.cnblogs.com/grandyang/p/4606822.html 这里有讲解

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        vector<int> res;
        int m = 0, n = 0, cm = 0, cn = 0;
        for (auto &a : nums) {
            if (a == m) ++cm;
            else if (a ==n) ++cn;
            else if (cm == 0) m = a, cm = 1;
            else if (cn == 0) n = a, cn = 1;
            else --cm, --cn;
        }
        cm = cn = 0;
        for (auto &a : nums) {
            if (a == m) ++cm;
            else if (a == n) ++cn;
        }
        if (cm > nums.size() / 3) res.push_back(m);
        if (cn > nums.size() / 3) res.push_back(n);
        return res;
    }
};