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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

---

思路是参考了高票答案，该想法的前提是数组中major元素个数超过了总元素个数的一半。因此可以将数组元素分为两类，major和非major，major元素的个数是始终大于非major元素的总个数的，所以采用一个==就可以判断是否是最主要的major元素了。
因为即使剩余元素加起来的个数也没办法将major的count数减小为0。

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