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!

分析：

这里用到了一种特殊的方法A Linear Time Majority Vote Algorithm

http://www.programcreek.com/2014/02/leetcode-majority-element-java/

参考代码如下：

http://www.programcreek.com/2014/07/leetcode-majority-element-ii-java/

public class Solution {
    public List<Integer> majorityElement(int[] nums) {
        List<Integer> result = new ArrayList<Integer>();
     
        Integer n1=null, n2=null;
        int c1=0, c2=0;
     
        for(int i: nums){
            if(n1!=null && i==n1.intValue()){
                c1++;
            }else if(n2!=null && i==n2.intValue()){
                c2++;
            }else if(c1==0){
                c1=1;
                n1=i;
            }else if(c2==0){
                c2=1;
                n2=i;
            }else{
                c1--;
                c2--;
            }
        }
     
        c1=c2=0;
     
        for(int i: nums){
            if(i==n1.intValue()){
                c1++;
            }else if(i==n2.intValue()){
                c2++;
            }
        }
     
        if(c1>nums.length/3)
            result.add(n1);
        if(c2>nums.length/3)
            result.add(n2);
     
        return result;
    }
}