[LeetCode&Python] Problem 383. Ransom Note

标签：sum   case   def   ret   port   problem   UNC   only   bit   

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

from collections import Counter
class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        c=Counter(magazine)
        for i in ransomNote:
            if c[i]==0 or i not in c:
                return False
            else:
                c[i]-=1
        return True

[LeetCode&Python] Problem 383. Ransom Note

标签：sum   case   def   ret   port   problem   UNC   only   bit   

原文地址：https://www.cnblogs.com/chiyeung/p/10048347.html