【力扣】2021.12.4

最新推荐文章于 2024-09-15 15:29:37 发布

ssouthmelon

最新推荐文章于 2024-09-15 15:29:37 发布

阅读量3.6k

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/ssouthmelon/article/details/121712579

版权

在这里插入图片描述

def canConstruct(ransomNote: str, magazine: str) -> bool:
    dic = dict()
    for i in magazine:
        if i not in dic:
            dic[i] = 1
        else:
            dic[i] += 1
    for s in ransomNote:
        if s in dic and dic[s]>0:
            dic[s] -= 1
        else:
            return False
    return True


if __name__ == '__main__':
    ransomNote = "c"
    magazine = "a"
    res = canConstruct(ransomNote,magazine)
    if res:
        print('zz')
    else:
        print('nn')