leetcode242

public class Solution {
    public bool IsAnagram(string s, string t) {
        Dictionary<char, int> dic = new Dictionary<char, int>();
            foreach (var c in s)
            {
                if (!dic.ContainsKey(c))
                {
                    dic.Add(c, 1);
                }
                else
                {
                    dic[c]++;
                }
            }

            foreach (var c in t)
            {
                if (!dic.ContainsKey(c))
                {
                    return false;
                }
                else
                {
                    dic[c]--;
                }
            }

            foreach (var d in dic)
            {
                if (d.Value != 0)
                {
                    return false;
                }
            }

            return true;
    }
}

https://leetcode.com/problems/valid-anagram/#/description

 

补充一个python的实现：

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        c1 = collections.Counter(s)
        c2 = collections.Counter(t)
        if len(c1) != len(c2):
            return False
        for k,v in c1.items():
            if k not in c2 or v != c2[k]:
                return False
        return True