1、散列表/字典记录信息
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
dict = {}
# 字典存入s的信息
for ch in s:
if ch in dict:
dict[ch] = dict[ch]+1
else:
dict[ch] = 1
# 信息匹配
for ch in t:
if ch not in dict or dict[ch]<1: # 不匹配
return False
else:
dict[ch] = dict[ch]-1
if dict[ch]<1:
del [dict[ch]]
if len(dict)==0: # 匹配
return True
else:
return False
2、先排序再比较
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
# 排序
s = list(s)
t = list(t)
return sorted(s) == sorted(t)