229. Majority Element II

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Note: The algorithm should run in linear time and in O(1) space.

Example 1:

Input: [3,2,3]
Output: [3]

Example 2:

Input: [1,1,1,3,3,2,2,2]
Output: [1,2]

思路：由于要求算法的时间复杂度为O（N），并且空间复杂度为O（1），那么哈希表，排序等算法均不能考虑

但我们注意到题目要求出现的众数必须出现n/3次以上，易知这样的数在一个数组中出现最多只有两个

由此，按照摩尔投票的模板，我们容易写出如下代码

class Solution {
    public List<Integer> majorityElement(int[] nums) {
        List<Integer> res = new ArrayList<>();
        if(nums == null || nums.length == 0)
            return res;
        //定义两个候选人
        int candidateA = nums[0];
        int candidateB = nums[0];
        int countA = 0;
        int countB = 0;
        for(int num:nums) {
            if(num == candidateA) {
                countA++;
                continue;
            }
            if(num == candidateB) {
                countB++;
                continue;
            }
            if(countA == 0) {
                candidateA = num;
                countA = 1;
                continue;
            }
            if(countB == 0) {
                candidateB = num;
                countB = 1;
                continue;
            }
            countA--;
            countB--;
        }
        countA = 0;
        countB = 0;
        for(int num:nums) {
            if(num == candidateA) {
                countA++;
            } else if(num == candidateB) {
                countB++;
            }
        }
        if(countA > nums.length/3) {
            res.add(candidateA);
        }
        if(countB > nums.length/3) {
            res.add(candidateB);
        }
        return res;
    }
}