给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的字母异位词。
示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s = "rat", t = "car" 输出: false链接：https://leetcode-cn.com/leetbook/read/learn-data-sturcture-in-7-chapters/xlo8wm/
class Solution: def isAnagram(self, s: str, t: str) -> bool: if len(s) != len(t): return False desk1 = {} desk2 = {} for i in s: if i in desk1: desk1[i] = desk1[i] + 1 else: desk1[i] = 1 for j in t: if j in desk2: desk2[j] = desk2[j] + 1 else: desk2[j] = 1 if desk1 == desk2: return True else: return False