给定一个赎金信 (ransom) 字符串和一个杂志(magazine)字符串,判断第一个字符串 ransom 能不能由第二个字符串 magazines 里面的字符构成。如果可以构成,返回 true ;否则返回 false。
(题目说明:为了不暴露赎金信字迹,要从杂志上搜索各个需要的字母,组成单词来表达意思。杂志字符串中的每个字符只能在赎金信字符串中使用一次。)
示例 1:
输入:ransomNote = “a”, magazine = “b”
输出:false
示例 2:
输入:ransomNote = “aa”, magazine = “ab”
输出:false
示例 3:
输入:ransomNote = “aa”, magazine = “aab”
输出:true
提示:
你可以假设两个字符串均只含有小写字母。
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
# if len(magazine) < len(ransomNote):
# return False
# val = {}
# for i in range(len(ransomNote)):
# if ransomNote[i] in val:
# val[ransomNote[i]] += 1
# else:
# val[ransomNote[i]] = 1
# for i in range(len(magazine)):
# if magazine[i] in val:
# val[magazine[i]] -= 1
# print(val)
# for i in val:
# if val[i] > 0:
# return False
# return True
if len(magazine) < len(ransomNote):
return False
val = [0] * 26
for i in range(len(ransomNote)):
val[ord(ransomNote[i]) - ord('a')] += 1
for i in range(len(magazine)):
val[ord(magazine[i]) - ord('a')] -= 1
print(val)
for i in val:
if i > 0:
return False
return True