LeetCode 242. Valid Anagram

描述

解决

方法一

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

方法二

class Solution {
public:
bool isAnagram(string s, string t) {
int n = s.length();
unordered_map<char, int> counts;
for (int i = 0; i < n; i++) {
counts[s[i]]++;
counts[t[i]]--;
}
for (auto count : counts)
if (count.second){
return false;
}
return true;
}
};