给定一个赎金信 (ransom) 字符串和一个杂志(magazine)字符串,判断第一个字符串ransom能不能由第二个字符串magazines里面的字符构成。如果可以构成,返回 true ;否则返回 false。
(题目说明:为了不暴露赎金信字迹,要从杂志上搜索各个需要的字母,组成单词来表达意思。)
注意:你可以假设字符串中所有字符都是小写
canConstruct("a", "b") -> false canConstruct("aa", "ab") -> false canConstruct("aa", "aab") -> true
1:杂志字符串转字典,字典中元素存放格式为 “ 字符:次数 ” ,访问赎金信字符串,匹配字典。
def canConstruct(self, ransomNote, magazine):
"""
:type ransomNote: str
:type magazine: str
:rtype: bool
"""
magDic = {}
for i in magazine:
magDic[i] = magDic.get(i, 0) + 1
for i in ransomNote:
if not magDic.get(i): #某个字母不存在或者为0均返回False
return False
magDic[i] -= 1
return True
2:借助dic()+set()+dic.items()+str.count()(参考他人)
def canConstruct(self, ransomNote, magazine):
"""
:type ransomNote: str
:type magazine: str
:rtype: bool
"""
ranChaDic = {}
ranSet = set(ransomNote)
for i in ranSet:
ranChaDic[i] = ransomNote.count(i)
for key, value in ranChaDic.items():
if magazine.count(key) < value:
return False
return True
高级写法(参考他人)
def canConstruct(self, ransomNote, magazine):
"""
:type ransomNote: str
:type magazine: str
:rtype: bool
"""
return all(magazine.count(i)>=ransomNote.count(i) for i in set(ransomNote))
3:str.replace()方法(参考他人)
def canConstruct(self, ransomNote, magazine):
"""
:type ransomNote: str
:type magazine: str
:rtype: bool
"""
for i in ransomNote:
newMagazine = magazine.replace(i, '+', 1) #如果现阶段magazine字符串中不存在i元素,就不会进行替换操作
if newMagazine == magazine: #没有替换操作,就说明赎金信中出现了magazine中现阶段不存在的字符
return False
magazine = newMagazine
return True
算法题来自:https://leetcode-cn.com/problems/ransom-note/description/