题目:
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题目链接
题意:
给一个目标字符串ransomNote和一个库字符串magazine,要求使用magazine中的字符重组成ransomeNote,每一个字符只可使用一次。
所有给出的字符全部为小写。
统计magazine中所有字母出现的次数,再枚举ransomNote中的字符,每次将已统计的数量减一,假若该字母的数量为负,则说明不成功,返回false。
否则全部枚举完之后,说明magezine中的字符可以重组成ransomNote,返回true。
代码如下:
class Solution {
public:
int count[100];
bool canConstruct(string ransomNote, string magazine) {
memset(count, 0, sizeof count);
for (char c : magazine) {
count[c - 'a'] ++;
}
for (char c : ransomNote) {
if (--count[c - 'a'] < 0)
return false;
}
return true;
}
};