关闭

[leetcode] 383. Ransom Note 解题报告

标签: leetcodehash
679人阅读 评论(0) 收藏 举报
分类:

题目链接: https://leetcode.com/problems/ransom-note/


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

思路: 一个hash表即可

代码如下:

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        unordered_map<char, int> hash;
        for(auto ch: magazine) hash[ch]++;
        for(auto ch: ransomNote)
            if(--hash[ch]<0) return false;
        return true;
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:314300次
    • 积分:7266
    • 等级:
    • 排名:第3050名
    • 原创:425篇
    • 转载:0篇
    • 译文:0篇
    • 评论:24条
    最新评论