题目链接:https://leetcode-cn.com/problems/valid-anagram/
题目如下:
class Solution {
public:
bool isAnagram(string s, string t) {
unordered_map<char,int> hash1;
unordered_map<char,int> hash2;
for(int i=0;i<s.size();i++){
hash1[s[i]]++;
}
for(int i=0;i<t.size();i++){
hash2[t[i]]++;
}
for(auto [ch,_]:hash1){
if(hash1[ch]!=hash2[ch]) return false;
}
for(auto [ch,_]:hash2){
if(hash1[ch]!=hash2[ch]) return false;
}
return true;
}
};