JAVA_LeetCode 1207_Unique Number of Occurrences


JAVA_LeetCode 1207_Unique Number of Occurrences

JAVA_LeetCode 1207_Unique Number of Occurrences 풀이 class Solution { public boolean uniqueOccurrences(int[] arr) { HashMap<Integer, Integer> map = new HashMap<>(); // 값 체크 for (int i : arr) { map.put(i, map.getOrDefault(i, 0) + 1); } HashSet<Integer> countMap = new HashSet<>(); // 발생횟수 체크 for (int count : map.values()) { if (!countMap.add(count)) { return false; } } return true; } } * 출처 https://leetcode.com/problems/unique-number-of-occurrences Unique Number of Occurrences - LeetCode Can you sol...


#JAVA #JAVA_LeetCode1207 #JAVA_LeetCode1207_UniqueNumberofOccurrences #JAVA_UniqueNumberofOccurrences #LeetCode1207_UniqueNumberofOccurrences

원문링크 : JAVA_LeetCode 1207_Unique Number of Occurrences