leetcode 242. Valid Anagram

传送门

 

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

Hide Tags

  Hash Table Sort

Show Similar Problems

 

 

 1 class Solution {
 2 public:
 3     bool isAnagram(string s, string t) {
 4         int scount[100];
 5         int tcount[100];
 6         memset(scount,0,sizeof(scount));
 7         memset(tcount,0,sizeof(tcount));
 8         string::iterator it;
 9         for(it = s.begin();it != s.end();it++){
10             scount[ (*it) - 'a' ] ++;
11         }
12         for(it = t.begin();it != t.end();it++){
13             tcount[ (*it) - 'a' ] ++;
14         }
15         for(int i = 0; i < 26 ;i++){
16             if(scount[i] != tcount[i]){
17                 return false;
18             }
19         }
20         return true;
21     }
22 };

 

转载于:https://www.cnblogs.com/njczy2010/p/5212923.html