JAVA_LeetCode 1160_Find Words That Can Be Formed by Characters


JAVA_LeetCode 1160_Find Words That Can Be Formed by Characters

JAVA_LeetCode 1160_Find Words That Can Be Formed by Characters 풀이 class Solution { public int countCharacters(String[] words, String chars) { Map<Character, Integer> ch = new HashMap<>(); // 문자 개수만큼 실행 for (char c : chars.toCharArray()) { ch.put(c, 1 + ch.getOrDefault(c, 0)); } int res = 0; for (String word : words) { Map<Character, Integer> copy = new HashMap<>(ch); for (char c : word.toCharArray()) { if (copy.containsKey(c) && copy.get(c) != 0) { copy.put(c, copy.get(c) - 1); } else { res -= w...


#JAVA #JAVA_FindWordsThatCanBeFormedbyCharacters #JAVA_LeetCode1160 #JAVA_LeetCode1160_FindWordsThatCanBeFormedbyCharacters #LeetCode1160_FindWordsThatCanBeFormedbyCharacters

원문링크 : JAVA_LeetCode 1160_Find Words That Can Be Formed by Characters