https://leetcode.cn/problems/ransom-note/
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
int[] count=new int[26];
for(char c:magazine.toCharArray()){
count[c-'a']++;
}
for(char c:ransomNote.toCharArray()){
count[c-'a']--;
if(count[c-'a']<0){
return false;
}
}
return true;
}
}
一切都是由于没做也不会做今天的每日一题,于是找了相似题目——一道简单题