hier ist mein Code:
Code: Select all
class Solution {
public:
bool isAnagram(string s, string t) {
if(s.length() != t.length()) return false;
unordered_map mpp1;
unordered_map mpp2;
for(int i = 0; i < s.length(); i++ ){
if(mpp1.find(s[i]) != mpp1.end()){
mpp1[s[i]] = 1;
}else if(mpp1.find(s[i]) == mpp1.end()){
mpp1[s[i]]++;
}
if(mpp2.find(t[i]) != mpp2.end()){
mpp2[t[i]] = 1;
}else{
mpp2[t[i]]++;
}
}
return mpp1 == mpp2;
}
};
Was ist Ihrer Meinung nach das Problem hier?
Mobile version