242 Valid Anagram

Description:

Given, Strings s and T, write a function to determine if it is a anagram of s.

For example,
s = "Anagram", t = "Nagaram", return true.
s = "Rat", t = "Car", return false.

Note:
Assume the string contains only lowercase alphabets.

The implementation code is as follows:

1 classSolution {2  Public:3     BOOLIsanagram (stringSstringt) {4unordered_map<Char,int>Map1;5         if(S.length ()! = T.length ())return false;6          for(inti =0; I < s.length (); i++) {7map1[s[i]]++;8         }9          for(inti =0; I < t.length (); i++) {Tenmap1[t[i]]--; One         } A          for(Auto it = Map1.begin (); it!= map1.end (); it++) { -             if((*it). Second! =0) { -                 return false; the             } -         } -         return true; -     } +};

242 Valid Anagram