1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | class Solution { public: bool isAnagram(string s, string t) { if (s.length() != t.length()) return false; unordered_map<char, int> chrMap; for (auto &c : s) chrMap[c]++; for (auto &c : t) { if (chrMap.find(c) == chrMap.end() || chrMap[c] == 0) return false; chrMap[c]--; } return true; } }; |