Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.
Each letter in the magazine string can only be used once in your ransom note.
Note:
You may assume that both strings contain only lowercase letters.
canConstruct("a", "b") -> false canConstruct("aa", "ab") -> false canConstruct("aa", "aab") -> true
题意:如果字符串magazine中包含ransom Note中的所有字母,返回true;否则返回false;
思路:hash table——利用一个数组存取ransomNote中每个字母出现的次数(也可利用HashMap)
public boolean canConstruct(String ransomNote, String magazine) {
int[] rec=new int[26];
for(int i=0;i<ransomNote.length();i++){
if(rec[ransomNote.charAt(i)-'a']==0)
rec[ransomNote.charAt(i)-'a']=1;
else
rec[ransomNote.charAt(i)-'a']++;
}
for(int j=0;j<magazine.length();j++){
if(rec[magazine.charAt(j)-'a']>0)
rec[magazine.charAt(j)-'a']--;
}
for(int k=0;k<rec.length;k++){
if(rec[k]>0)
return false;
}
return true;
}