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


class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """

        flag = True
        dica = {}
        for i in magazine:
            if not dica.has_key(i):
                dica[i]=1
            else:
                dica[i] += 1
        for i in ransomNote:
            if not dica.has_key(i):
                flag = False
                break
            else:
                dica[i] -= 1
                if dica[i]<0:
                    flag = False
                    break
        return flag

 

转载于:https://www.cnblogs.com/bernieloveslife/p/7610055.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值