https://oj.leetcode.com/problems/majority-element/

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.

Credits:

Special thanks to @ts for adding this problem and creating all test cases.

Show Tags

public class Solution {
    public int majorityElement(int[] num) {
        int last=num[0];
        int cnt=1;
        for(int i=1;i<num.length;i++){
            if(num[i]!=last){
                cnt--;
                if(cnt==0){
                    last=num[i];
                    cnt=1;
                }
            }else{
                cnt++;
            }
        }
        return last;
    }
}