给定一个赎金信 (ransom) 字符串和一个杂志(magazine)字符串,判断第一个字符串 ransom 能不能由第二个字符串 magazines 里面的字符构成。如果可以构成,返回 true ;否则返回 false。
示例 1:
输入:ransomNote = “a”, magazine = “b”
输出:false
示例 2:
输入:ransomNote = “aa”, magazine = “ab”
输出:false
示例 3:
输入:ransomNote = “aa”, magazine = “aab”
输出:true
提示:
你可以假设两个字符串均只含有小写字母。
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
boolean isWordsFromMagazine = true;
int[] wordsCount = new int[26];
//记录 magazine中各字母的个数
for(int i = 0; i < magazine.length(); i++)
wordsCount[magazine.charAt(i)-97]++;
//减去 ransomNote中各字母的个数
for(int i = 0; i < ransomNote.length(); i++)
wordsCount[ransomNote.charAt(i)-97]--;
//某字母个数小于 0则该字母在 magazine中不存在
for(int i = 0; i < wordsCount.length; i++)
if(wordsCount[i] < 0) {
isWordsFromMagazine = false;
break;
}
return isWordsFromMagazine;
}
}