- 赎金信(难度 简单)
给你两个字符串:ransomNote 和 magazine ,判断 ransomNote 能不能由 magazine 里面的字符构成。
如果可以,返回 true ;否则返回 false 。
magazine 中的每个字符只能在 ransomNote 中使用一次。
示例 1:
输入:ransomNote = “a”, magazine = “b”
输出:false
示例 2:
输入:ransomNote = “aa”, magazine = “ab”
输出:false
示例 3:
输入:ransomNote = “aa”, magazine = “aab”
输出:true
提示:
1 <= ransomNote.length, magazine.length <= 105
ransomNote 和 magazine 由小写英文字母组成
题解:
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
temp=collections.Counter(magazine)
for i in ransomNote:
if i in temp and temp[i]!=0:
temp[i]-=1
else:
return False
return True
一行解决法:
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
return not collections.Counter(ransomNote) - collections.Counter(magazine)
时间复杂度 o(n)
空间复杂度o(m)