zoukankan      html  css  js  c++  java
  • [LeetCode] 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.

    分析:和Majority Number类似的思路。但是要考虑不存在的情况。时间复杂度O(n),空间复杂度O(1)

    class Solution {
    public:
        vector<int> majorityElement(vector<int>& nums) {
            vector<int> res;
            if (nums.empty()) return res;
            if (nums.size() == 1) {
                res.push_back(nums[0]);
                return res;
            }
            
            int candidate1 = 0;
            int candidate2 = 0;
            int times1 = 0;
            int times2 = 0;
            
            for (int i = 0; i < nums.size(); i++) {
                if (nums[i] == candidate1) {
                    times1++;
                } else if (nums[i] == candidate2) {
                    times2++;
                } else if (times1 == 0) {
                    times1 = 1;
                    candidate1 = nums[i];
                } else if (times2 == 0) {
                    times2 = 1;
                    candidate2 = nums[i];
                } else {
                    times1--;
                    times2--;
                }
            }
            
            times1 = 0;
            times2 = 0;
            for (int i = 0; i < nums.size(); i++) {
                if (nums[i] == candidate1) {
                    times1++;
                } else if (nums[i] == candidate2) {
                    times2++;
                }
            }
            
            if (times1 > nums.size() / 3)
                res.push_back(candidate1);
            if (times2 > nums.size() / 3)
                res.push_back(candidate2);
            
            return res;
        }
    };
  • 相关阅读:
    python实现Linux启动守护进程
    多维监控体系
    python 设计模式
    markdown安装和使用
    cobbler深入学习
    cobbler重装、web、定制化
    cobbler工作流分析
    cobbler安装、部署、测试
    Django中Celery的实现介绍(一)
    centos 搭建git服务器
  • 原文地址:https://www.cnblogs.com/vincently/p/4823662.html
Copyright © 2011-2022 走看看