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
c++ code:
class Solution {
public:
bool isAnagram(string s, string t) {
if(s.length() != t.length()) return false;
int hash[26] = {0};
for(int i=0;i<s.length();i++) hash[s[i]-'a']++;
for(int i=0;i<t.length();i++) hash[t[i]-'a']--;
for(int h : hash)
if(h != 0) return false;
return true;
}
};原文：http://blog.csdn.net/itismelzp/article/details/51588413