Leetcode 169. Majority Element

169. Majority Element

アプローチ

HashMap

class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer, Integer> hashmap = new HashMap<>();
        for (int num : nums) {
            hashmap.put(num, hashmap.getOrDefault(num, 0) + 1);
        }
        int majority = nums.length / 2;
        return hashmap.entrySet().stream().filter(obj -> obj.getValue() > majority).findFirst().get().getKey();
    }
}