Leetcode #383 Ransom Note

最新推荐文章于 2024-03-18 09:48:15 发布

时光未老丶

最新推荐文章于 2024-03-18 09:48:15 发布

阅读量232

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_32796425/article/details/60984302

版权

leetcode 专栏收录该内容

44 篇文章 0 订阅

订阅专栏

Description

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

Explain

统计一个字符串各字母出现的次数，然后在另一个字符串里减即可，刚好python里有个计数的Counter

Code

class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        import collections
        return not collections.Counter(ransomNote) - collections.Counter(magazine)