代码:
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
Map<Character,Integer> map = new HashMap<>();
int m = magazine.length();
int n = ransomNote.length();
for(int i=0;i<m;i++){
map.put(magazine.charAt(i),map.getOrDefault(magazine.charAt(i),0)+1);
}
for(int i=0;i<n;i++){
char c = ransomNote.charAt(i);
if(map.containsKey(c)){
map.put(c,map.get(c)-1);
if(map.get(c)==0){
map.remove(c);
}
}else{
return false;
}
}
return true;
}
}