LeetCode——剑指 Offer 39【数组中出现次数超过一半的数字】

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

class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer,Integer> map=new HashMap<>();
        int n=nums.length/2;
        for(int num:nums){
            map.put(num,map.getOrDefault(num,0)+1);
            if(map.get(num)>n){
                return num;
            }
        }
        return 0;
    }
}