一个简单的突发奇想求众数，LeetCode169. Majority Element

Runtime 1ms, beats99.86%
从摩尔投票思想出发：
因为题目众数是出现次数超过一半，所以只可能有一个数字出现次数超过一半，就给一个变量num和count；
遍历nums:
count为0时，重新赋值
count不为0时，判断，int a = num==nums[i] ? count++: count–

class Solution {
    public int majorityElement(int[] nums) {
       /*
       because "The majority element is the element that appears more than ⌊ n/2 ⌋ times",
       there are only 1 element with more than n / 2 occurrences, give it a temp number and count;
    Iterate through the array. 
    When the elements in the array are the same as num, the corresponding counter is increased by 1.
    If counter is 0, assign the traversed element to num;
    Otherwise counter is decremented by 1
    
    so,in sum, we can write it in two cases: count ==0? or not.
    if count==0, assign new nums[i] to num, count++;
    else, see if num == nums[i] ?, yes,count++; no, count--; 
    in the end, the majority one will left.
       */ 
        int num = 0;
        int count =0;
        for(int i =0; i<nums.length; i++)
        {
            if(count==0){
                num = nums[i];
                count++;
            }
            else{
                int a = num == nums[i] ? count++ : count--;                              
            }
        }
        return num;        
    }
}