229. Majority Element II

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

jimhust

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

阅读量159

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/jimhust/article/details/60778342

版权

leetcode 专栏收录该内容

69 篇文章 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!

imagine each number are competing with each other. So for each majority element, it must kills 2 other element to survive at last.

We use i1, i2 to record the majority elements and c1 c2 to record the count.

If there is a vacant, fill it

If there is a same, add count.

If there is no same number, substract 1 from c1,c2 (killing 2 other numbers).

At last we need to check the i1 and i2.

Code:

public class Solution {
    public List<Integer> majorityElement(int[] nums) {
        int i1 = 0;
        int i2 = 0;
        int c1 = 0;
        int c2 = 0;
        
        
        for(int i : nums){
            if(c1 > 0 && i == i1){
                c1++;
            } else if(c2 > 0 && i == i2){
                c2++;
            } else {
                if(c1 == 0){
                    i1 = i;
                    c1++;
                } else if(c2 == 0){
                    i2 = i;
                    c2++;
                } else{
                    c1--;
                    c2--;
                }
            }
            
        }
        List<Integer> ret = new ArrayList<>();
        if(c1 > 0 && check(nums,i1)) ret.add(i1);
        
        if(c2 > 0 && check(nums,i2)) ret.add(i2);
        return ret;
    }
    
    
    public boolean check(int[] nums, int i){
        int count = 0;
        for(int n : nums){
            if(n == i) count++;
        }
        return count > nums.length / 3;
    }
    
}