一、题目描述
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
思路:一开始把题意理解错了,直到看到错误用例才知道,ransom 构成 magazines 并一定是按顺序连续的。例如用例 canConstruct("fffbfg", "effjfggbffjdgbjjhhdegh"),最后返回的是 true。又由于题中说了都是小写字母,因此用一个大小为26的数组就可以解决问题。
c++代码(28ms)
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
int len1=ransomNote.size();
int len2=magazine.size();
if(len1==0 && len2==0)
return true;
else if(len1>len2)
return false;
else{
int alpha[26]={0};
for(int i=0; i<len1; i++){
alpha[ransomNote[i]-'a']++;
}
for(int i=0; i<len2; i++){
alpha[magazine[i]-'a']--;
}
for(int i=0; i<26; i++)
if(alpha[i]>0)
return false;
return true;
}
}
};
另一种写法(88ms)
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
unordered_map<char, int> cnt;
for(int i=0; i<magazine.size(); i++){
cnt[magazine[i]]++;
}
for(int i=0; i<ransomNote.size(); i++){
if(--cnt[ransomNote[i]]<0)
return false;
}
return true;
}
};