Given two strings s and t, write a function to determine if t is an anagram of s.
For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.
Note:
You may assume the string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
Subscribe to see which companies asked this question
class Solution {
public:
bool isAnagram(string s, string t) {
int lenA = s.length(), lenB=t.length();
if(lenA!=lenB) return false;
vector<int> temp(260, 0);
for(int i = 0; i < lenA; i++) {
temp[s[i]]+=1;
temp[t[i]]-=1;
}
for(int i = 0; i < 259; i++) {
if(temp[s[i]]!=0) return false;
}
return true;
}
};