[LeetCode][JavaScript]Majority Element II

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.

https://leetcode.com/problems/majority-element-ii/

---

Moore voting algorithm，时间复杂度是O(3n)，空间复杂度是O(1)。

第一轮遍历，每找到三个不同的数，就删掉这三个数，最后剩下的就是可能的结果。

为什么是可能的结果呢，比如：

majorityElement([1,2,2,3,3,3,3,3]) 遍历会删掉[1,2,3]，最后剩下2(count == 1)和3(count == 4)，但明显只有3才是正确答案。

所以还需要两轮遍历，确定结果。

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var majorityElement = function(nums) {
    var i = 0, res = null, trinity = [], curr = null; 
    var result = [];
    for(i = 0; i < nums.length; i++){
        curr = nums[i];
        res = isInTrinity(curr, trinity);
        if(res !== -1){
            trinity[res].count++;
        }else{
            if(trinity.length <= 1){
                trinity.push({key : curr, count : 1});
            }else{
                trinity[1].count--;
                if(trinity[1].count === 0){
                    trinity.pop();
                }
                trinity[0].count--;
                if(trinity[0].count === 0){
                    trinity.shift();
                }
            }
        }
    }    
    if(trinity[0]){
        verifyNum(trinity[0].key, result);
    }
    if(trinity[1]){
        verifyNum(trinity[1].key, result);
    }
    return result;
    
    function verifyNum(num, result){
        var count = 0;
        for(i = 0; i < nums.length; i++){
            if(nums[i] === num){
                count++;
            }
        }
        if(count > nums.length / 3){
            result.push(num);
        }
    }
    function isInTrinity(num, trinity){
        for(var i = 0; i < trinity.length; i++){
            if(trinity[i].key === num){
                return i;
            }
        }
        return -1;
    }
};