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
注意:
这个不是求字符串的问题。
这个题和我以前做的一个题非常的像,请点击:同构字符串
public static boolean canConstruct(String ransomNote, String magazine) {
//明确:有26个字母 声明26个空间的int数组 初始化为全0
int[] arr = new int[26];
//这个操作可以统计出有多少个abcd......z也就是统计出每个字母的个数
for (int i = 0; i < magazine.length(); i++) {
int MIndex =magazine.charAt(i) - 'a';
arr[MIndex]++;
}
for (int i = 0; i < ransomNote.length(); i++) {
if(--arr[ransomNote.charAt(i)-'a'] < 0) {
return false;
}
}
return true;
}