思路一:hash
class Solution {
public:
bool isAnagram(string s, string t) {
if (s.length() != t.length()) return false;
vector<int> alpha(26, 0);
for (int i = 0; i < s.length(); i++){
alpha[s[i] - 'a']++;
alpha[t[i] - 'a']--;
}
for (int i = 0; i < 26; i++){
if (alpha[i]) return false;
}
return true;
}
};
思路二:排序
class Solution {
public:
bool isAnagram(string s, string t) {
int n = s.size(), m = t.size();
if (n != m) return false;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
return s == t;
}
};