1. 題目
https://leetcode-cn.com/problems/valid-anagram/
給定兩個字符串 s 和 t ，編寫一個函數來判斷 t 是否是 s 的一個字母異位詞。
示例 1:
輸入: s = "anagram", t = "nagaram"
輸出: true
示例 2:
輸入: s = "rat", t = "car"
輸出: false
說明:
你可以假設字符串只包含小寫字母。
2. 我的AC
class Solution(object):
def isAnagram(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
mappings = {}
mappingt = {}
for ele in s:
if ele not in mappings:
mappings[ele] = 1
else:
mappings[ele] += 1
for ele in t:
if ele not in mappingt:
mappingt[ele] = 1
else:
mappingt[ele] += 1
return mappings == mappingt
3. 小結
- 兩個字典是否相同
mappings == mappingt # True, Flase
cmp(mappings, mappingt) # 0, 1
cmp(mappings, mappingt) == 0 # True, Flase
