leetcode-master
leetcode-master copied to clipboard
383. 赎金信 Java解法
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
if(magazine.length()==0) return ransomNote.length==0;
int[] leter = new int[26];
for(char c:magazine.toCharArray()){
leter[c-'a'] += 1;
}
for(char a:ransomNote.toCharArray()){
leter[a-'a'] -= 1;
if(leter[a-'a']<0)
return false;
}
return true;
}
}
https://www.programmercarl.com/0383.%E8%B5%8E%E9%87%91%E4%BF%A1.html#%E5%85%B6%E4%BB%96%E8%AF%AD%E8%A8%80%E7%89%88%E6%9C%AC 好像有带注释的java方法;了