Leetcode 383. Ransom Note
2018-01-01 16:20
274 查看
题目的意思是判断ransom的词能否由magazine中的字符构成,magazine中每个字符只能使用一次。
思路:和Leetcode242. Valid Anagram的做法一样。
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
vector<int>flag(26);
for(auto x: magazine)
flag[x-'a']++;
for(auto y: ransomNote)
{
if(--flag[y-'a']<0)
return false;
}
return true;
}
};
思路:和Leetcode242. Valid Anagram的做法一样。
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
vector<int>flag(26);
for(auto x: magazine)
flag[x-'a']++;
for(auto y: ransomNote)
{
if(--flag[y-'a']<0)
return false;
}
return true;
}
};
相关文章推荐
- LeetCode | 383. Ransom Note
- LeetCode 383. Ransom Note
- leetcode(383. Ransom Note)
- [LeetCode] 383. Ransom Note
- LeetCode 383. Ransom Note
- leetcode_383. Ransom Note-近似子串问题
- LeetCode-383. Ransom Note
- 383. Ransom Note [LeetCode]
- LeetCode 383. Ransom Note(java)
- leetcode(85).383. Ransom Note
- leetcode题解-58. Length of Last Word && 67. Add Binary && 383. Ransom Note
- LeetCode 383. Ransom Note
- leetcode - 383. Ransom Note
- 【leetcode】383. Ransom Note 恐吓信
- 【Leetcode】383. Ransom Note
- LeetCode 383. Ransom Note
- [Leetcode] 383. Ransom Note 解题报告
- LeetCode - 383. Ransom Note
- LeetCode 383. Ransom Note
- leetcode 383. Ransom Note