【LeetCode】242. Valid Anagram 解题小结

 

题目：

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.

Note:
You may assume the string contains only lowercase alphabets.

还是比较简单的。

class Solution {
public:
    bool isAnagram(string s, string t) {
        unordered_map<char, int> dicts;
        
        if (s.size() != t.size()) return false;
        
        for (int i = 0; i < s.size(); ++i){
            dicts[s[i]]++;
        }
        
        for (int i = 0; i < t.size(); ++i){
            if (dicts.find(t[i]) == dicts.end() || dicts[t[i]] == 0) return false;
            else
                dicts[t[i]]--;
        }
        
        return true;
    }
};