题目描述:
解题思路:
用字典记录字符串magazine中每个字符出现的次数。然后看看字典中magazine的各个字符的出现次数是否“够”字符串ransomNote中各个字符出现的次数。如果够,return True。如果存在有点字符不够,return False。
代码:
class Solution:def canConstruct(self, ransomNote: str, magazine: str) -> bool:d = {'a':0,'b':0,'c':0,'d':0,'e':0,'f':0,'g':0,'h':0,'i':0,'j':0,'k':0,'l':0,'m':0,'n':0,'o':0,'p':0,'q':0,'r':0,'s':0,'t':0,'u':0,'v':0,'w':0,'x':0,'y':0,'z':0}i = 0while(i < len(magazine)):d[magazine[i]] += 1i += 1j = 0while(j < len(ransomNote)):if d[ransomNote[j]] > 0:d[ransomNote[j]] -= 1else:return Falsej += 1if j == len(ransomNote):return True