zoukankan      html  css  js  c++  java
  • Majority Element II

    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:

    1. How many majority elements could it possibly have?
    2. Do you have a better hint? Suggest it!
    class Solution {
    public:
        vector<int> majorityElement(vector<int>& nums) {
    
            vector<int> res;
            int m = 0, n = 0, cm = 0, cn = 0;
            for (size_t i = 0; i < nums.size(); i++) {
                if (nums[i] == m)
                    cm++;
                else if (nums[i] == n)
                    cn++;
                else if (cm == 0) {
                    m = nums[i];
                    cm++;
                } else if (cn == 0) {
                    n = nums[i];
                    cn++;
                } else {
                    cn--;
                    cm--;
                }
            }
    
            cm = 0;
            cn = 0;
            for (auto num : nums) {
                if (num == m) {
                    cm++;
                } else if (num == n) {
                    cn++;
                }
            }
            if (cm > nums.size() / 3)
                res.push_back(m);
            if (cn > nums.size() / 3)
                res.push_back(n);
            return res;
        }
    };
  • 相关阅读:
    160726 smarty 笔记(2)
    160726 smarty 笔记(1)
    smarty内置函数
    smarty变量调节器
    smarty基础原理
    【Django】:基础
    【十八章】:Web框架
    汇总
    jQuery
    DOM
  • 原文地址:https://www.cnblogs.com/wxquare/p/5941260.html
Copyright © 2011-2022 走看看