242. Valid Anagram

Given two stringssandt, write a function to determine iftis an anagram ofs.

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?

classSolution{public:boolisAnagram(strings,stringt){if(s.size()!=t.size()){returnfalse;}else{intsBit[26]={0};//记录每个字母出现的次数inttBit[26]={0};constchar*sp=s.c_str();constchar*tp=t.c_str();for(inti=0;i<s.size();i++){sBit[*(sp+i)-'a']++;tBit[*(tp+i)-'a']++;}for(intj=0;j<26;j++){if(sBit[j]!=tBit[j]){returnfalse;}}returntrue;}}};

2016-08-05 13:52:07