LeetCode 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.

Example 1:

Input: [3,2,3]
Output: 3

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

求数组中出现次数最多的数。

通过不断消除不同元素直到没有不同元素，剩下的元素就是我们要找的元素。

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