Majority Element

Description:

Given an array of sizen, 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.

Solution

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