Majority Element

Majority Element.java

/*
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[] num) {
        int candidate = num[0];
        int counter = 0;
        
        for(int a : num) {
            if(counter == 0) {
                candidate = a;
                counter = 1;
            } else {
                if(candidate == a) {
                    counter ++;
                } else {
                    counter --;
                }
            }
        }
        return candidate;
    }
}