242. Valid Anagram

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

 

Source

28 ms

bool isAnagram(string s, string t) {
    sort(s.begin(), s.end());
    sort(t.begin(), t.end());
    return s == t;
}

 

8 ms

class Solution {
public:
    
    vector<char> getTable(string s) {
        vector<char> alphabet(27);
        for (auto a : s) {
            alphabet[a - 'a']++;
        }
        return alphabet;
    }
    
    bool isAnagram(string s, string t) {
        vector<char> s_table = getTable(s);
        vector<char> t_table = getTable(t);
        for (int i = 0; i < s_table.size(); i++) {
            if (s_table[i] != t_table[i]) {
                return false;
            }
        }
        return true;
    }
};