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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public:
bool (string s, string t) {
int a[26] = {0};
if (s.size() != t.size())
return false;
int len = s.size();
for (int i = 0; i < len; i++)
a[s[i] - 'a']++;
for (int i = 0; i < len; i++)
a[t[i] - 'a']--;
for (int i = 0; i < 26; i++)
{
if (a[i] > 0)
return false;
}
return true;
}
};