242. Valid Anagram（LeetCode）

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> ms;
        unordered_map<char, int> mt;
        int slen = s.size();
        int tlen = t.size();
        for (int i = 0; i < slen; i++)
        {
            ms[s[i]]++;
        }
        for (int i = 0; i < tlen; i++)
        {
            mt[t[i]]++;
        }
        if (ms == mt)
            return true;
        else
            return false;
    }
};