Majority Element

Leetcode https://leetcode.cn/problems/majority-element/

class Solution {
    public int majorityElement(int[] nums) {

        int candidate = nums[0];
        int counter = 0;

        for (int num : nums) {
            if (counter == 0) {
                candidate = num;
                counter = 1;
                continue;
            } 
            if (candidate == num) {
                counter++;
            } else {
                counter--;
            }
        }

        return candidate;
    }
}

Complexity

• Time = O(n)
• Space = O(1)

---