로딩
요청 처리 중입니다...

JAVA_LeetCode 1941_Check if All Characters Have Equal Number of Occurrences

 JAVA_LeetCode 1941_Check if All Characters Have Equal Number of Occurrences

JAVA_LeetCode 1941_Check if All Characters Have Equal Number of Occurrences 풀이 class Solution { public boolean areOccurrencesEqual(String s) { // map을 이용하여 문자 포함 개수를 넣은 뒤, set에 map의 value를 넣어서 길이가 1인지 확인하면 끝 HashMap map = new HashMap(); for(Character ch : s.toCharArray()) map.put(ch, map.getOrDefault(ch, 0) + 1); HashSet set = new HashSet(map.values()); return set.size() == 1; } } * 출처 https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occu...

# JAVA # JAVA_CheckifAllCharactersHaveEqualNumberofOccurrences # JAVA_LeetCode1941 # JAVA_LeetCode1941_CheckifAllCharactersHaveEqualNumberofOccurrences # LeetCode1941_CheckifAllCharactersHaveEqualNumberofOccurrences