重做169. Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

作业做到了这道题，再来做一遍。

public class Solution {
    public int majorityElement(int[] nums) {
        int res=0;
        int count=0;
        for(int i=0;i<nums.length;i++)
        {
            if(count==0)
            {
                res=nums[i];
                count++;
            }
            else if(nums[i]==res)
            {
                count++;
            }
            else
            {
                count--;
            }
        }
        return res;
    }
}