[leetcode]383. Ransom Note(Pyhton第八周第二次作业)

题目：

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

思路：

题目的意思其实就是，magazine字符串所给的所有字符能不够构成ransomNote，也就是要看，有没有足够的字符去构成ransomNote，自然想到将magazine的所有字符进行计数（使用python的字典），然后模拟构造ransomNote的过程，从记好数的字符中取，如果取了后相应的字符数量变为负数，或者根本没有这个字符，则不能成功。

代码

class Solution:
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        char = {}
        for i in range(len(magazine)):
            if magazine[i] in char:
                char[magazine[i]] += 1
            else:
                char[magazine[i]] = 1
        for i in range(len(ransomNote)):
            if ransomNote[i] in char:
                char[ransomNote[i]] -= 1
                if char[ransomNote[i]] < 0:
                    return False
            else:
                return False
        return True