LC.P2404[出现最频繁的偶数元素]

发表于2023-04-13|更新于2023-04-13|LeetCode

|字数总计:112|阅读时长:1分钟|阅读量:

方法一：哈希表

class Solution {
    public int mostFrequentEven(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : nums) {
            if (num % 2 == 0) map.merge(num, 1, Integer::sum);
        }
        int ans = -1, max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            int x = entry.getKey(), cnt = entry.getValue();
            if ((max < cnt) || (max == cnt && ans > x)) {
                max = cnt;
                ans = x;
            }
        }
        return ans;
    }
}