242. valid anagram

Difficulty: Easy

Given two strings s and t, write a function to determine if t is an anagram of s.

For example,
s = “anagram”, t = “nagaram”, return true.
s = “rat”, t = “car”, return false.

You may assume the string contains only lowercase alphabets.

What if the inputs contain unicode characters? How would you adapt your solution to such case?

判断两个词是不是同字母异构词。

维护两个字典：
key：字符串中的元素
value：元素出现的次数

返回两个字典是否相等

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

def (str):
    xSet = {}
    for i in str:
        try:
            xSet[i] += 1
        except KeyError:
            xSet[i] = 1
    return xSet
class Solution(object):
    def isAnagram(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: bool
        """
        return add_to_set(s) == add_to_set(t)