description:
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.
example:
canConstruct("a", "b") -> false canConstruct("aa", "ab") -> false canConstruct("aa", "aab") -> true
将magazines即右边的单词中的每个字母出现的次数用数组保存起来,在检索左边的单词时每检索一个字母就将数组中相对应字母的次数减去一次,如果没得减(即本来就是0的话)就返回0.检索完毕的话返回1.代码如下:
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int ma[26]={0};
for(int i=0;i<magazine.size();i++)
{
ma[magazine[i]-'a']++;
}
for(int i=0;i<ransomNote.size();i++)
{
if(ma[ransomNote[i]-'a']==0)return 0;
else ma[ransomNote[i]-'a']--;
}
return 1;
}
};