class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
HashMap<Character,Integer> map = new HashMap<>();
for (int i = 0; i < ransomNote.length(); i++) {
char word = ransomNote.charAt(i);
map.put(word, map.getOrDefault(word,0)+1);
}
for (int i = 0; i < magazine.length(); i++) {
char word = magazine.charAt(i);
map.put(word, map.getOrDefault(word,0)-1);
}
for (Integer value:map.values()){
if (value>0){
return false;
}
}
return true;
}
}
字典的遍历形式