169. Majority Element

LeetCode

// Time complexity: O(N)
class Solution {
    public int majorityElement(int[] nums) {
        int maxCntNum=Integer.MIN_VALUE;
        Map<Integer,Integer> countMap=new HashMap<>();
        for(int num:nums){
            int cnt=countMap.getOrDefault(num,0)+1;
            if(cnt>nums.length/2){
                maxCntNum=num;
            }
            countMap.put(num,cnt);
        }
        return maxCntNum;
    }
}