lc383. Ransom Note

weixin_34306593

于 2019-05-31 07:18:49 发布

阅读量142

点赞数

CC 4.0 BY-SA版权

文章标签： python

原文链接：https://juejin.im/post/5cf0d4b7f265da1bc23f5e4a

博客围绕LeetCode 383题“赎金信”展开，题目要求判断赎金信字符串能否由杂志字符串构建。给出思路是用Python的count()函数计算单个字符出现次数，比较两字符串。还给出了示例及代码来源。

383. 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

思路:使用python函数count(),计算单个字符出现次数，比较两个字符串代码：python3

class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        arr=[]
        for i in ransomNote:
            if i in arr:
                pass
            else:
                arr.append(i)
                if ransomNote.count(i)>magazine.count(i):
                    return False
        return True
复制代码