[LeetCode] Problem 169 - Majority Element

Posted on | In ,

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

No.1

Input: [3,2,3]

Output: 3

No.2

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

Output: 2

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
public int majorityElement(int[] nums) {
    int result = 0;
    int count = 0;

    for (int num : nums) {
        if (count == 0) {
            result = num;
            count = 1;
        }
        else if (num != result)
            count--;
        else
            count++;
    }

    return result;
}