/* 哈希表
思路:判断magazine的字符是否包含ransomNote 且magazine每个字符个数要大于等于ransomNote
1. 首先把magazine 中所有的字符放入哈希数组中,并计数,这里因为都是小写英文字符,所以数组的长度可以为26.
2. 遍历ransomNote中的所有字符,判断其在哈希数组中出现的次数是否为0;否则将其出现的次数减一,若结果小于0 返回false;
3. 程序运行到结尾,返回true
*/
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
if(ransomNote.size() > magazine.size()){
return false;
}
int record[26] = {0};
for(int i = 0;i<magazine.size();i++){
record[magazine[i] - 'a']++;
}
for(int i = 0;i<ransomNote.size();i++){
if( --record[ransomNote[i] - 'a'] <0){
return false;
}
}
return true;
}
};
* 暴力解法
思路:判断magazine的字符是否包含ransomNote 且magazine每个字符个数要大于等于ransomNote
1. 外层for循环magazine 内层for循环ransomNote
2. 每次 magazine[i] == ransomNote[j] 则说明在magazine中找到了对应的字符可以用,把对应的ransomNote[j]擦除掉
*/
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
for(int i = 0 ;i < magazine.size();i++){
for(int j =0;j<ransomNote.size();j++){
if(magazine[i] == ransomNote[j]){
ransomNote.erase(ransomNote.begin()+j);
}
}
}
if(ransomNote.length() == 0){
return true;
}
return false;
}
};