Skip to content

Latest commit

 

History

History
51 lines (34 loc) · 1.43 KB

383-ransom-note.md

File metadata and controls

51 lines (34 loc) · 1.43 KB

383. Ransom Note - 赎金信

给定一个赎金信 (ransom) 字符串和一个杂志(magazine)字符串,判断第一个字符串ransom能不能由第二个字符串magazines里面的字符构成。如果可以构成,返回 true ;否则返回 false。

(题目说明:为了不暴露赎金信字迹,要从杂志上搜索各个需要的字母,组成单词来表达意思。)

注意:

你可以假设两个字符串均只含有小写字母。

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true

题目标签:String

题目链接:LeetCode / LeetCode中国

题解

Language Runtime Memory
python3 68 ms N/A
from collections import Counter

class Solution:
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        c1 = Counter(ransomNote)
        c2 = Counter(magazine)
        for k, v in c1.items():
            if k not in c2 or  v > c2[k]:
                return False
        return True