LeetCode 169. Majority Element

public class Solution {
    public int majorityElement(int[] nums) {
        int len = nums.length;
        int counter = 0, candidate = nums[0];
        for (int i : nums) {
            if (counter == 0) {
                candidate = i;
                counter++;
            } else if (i == candidate) { 
                counter++; 
                if (counter > len / 2) break;
            }
            else { counter--; }
        }
        return candidate;
    }
}