【每日一题Day176】LC2404出现最频繁的偶数元素 | 哈希表

class Solution {
    public int mostFrequentEven(int[] nums) {
        Map<Integer,Integer> counts = new HashMap<>();
        int res = -1, maxFre = 0;
        for (int num : nums){
            if ((num & 1) == 0){
                counts.put(num, counts.getOrDefault(num, 0) + 1);
                if (counts.get(num) > maxFre){
                    res = num;
                    maxFre = counts.get(num);
                }else if (counts.get(num) == maxFre){
                    res = Math.min(num, res);
                }
            }
        }
        return res;
    }
}