[LeetCode] Ransom Note 赎金条
2016-08-12 11:35
260 查看
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.
非常简单的一道题,就是用哈希Map统计字符的个数,参见代码如下:
LeetCode All in One 题目讲解汇总(持续更新中...)
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
非常简单的一道题,就是用哈希Map统计字符的个数,参见代码如下:
class Solution { public: bool canConstruct(string ransomNote, string magazine) { unordered_map<char, int> m; for (char c : magazine) ++m[c]; for (char c : ransomNote) { if (--m[c] < 0) return false; } return true; } };
LeetCode All in One 题目讲解汇总(持续更新中...)
相关文章推荐
- LeetCode : Ransom Note
- LeetCode之Ransom Note (Java+C)
- LeetCode--No.383--Ransom Note
- LeetCode Ransom Note(字符串)
- LeetCode:Ransom Note_383
- 【Leetcode】Ransom Note
- 【LeetCode】383 Ransom Note(java)
- Leetcode 383 Ransom Note
- leetcode: Ransom Note
- leetcode之Ransom Note
- LeetCode:383 Ransom Note
- 【python】【leetcode】【算法题目383—Ransom Note】
- leetcode[Ransom Note]//待整理多种解法
- [LeetCode]383. Ransom Note(赎金票据)
- [Leetcode]Ransom Note
- [LeetCode] Ransom Note (java)
- leetcode---Ransom Note
- 【LeetCode-383】Ransom Note(C++)
- [LeetCode] Ransom Note
- Java [Leetcode 383]Ransom Note