题目:
Given two strings s
and t
, return true
if t
is an anagram of s
, and false
otherwise.
Example 1:
Input: s = "anagram", t = "nagaram" Output: true
Example 2:
Input: s = "rat", t = "car" Output: false
Constraints:
1 <= s.length, t.length <= 5 * 104
s
andt
consist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
代码:
class Solution {
public:
bool isAnagram(string s, string t) {
int letters[26] = {0};
for(int i = 0; i<s.size(); i++)
{
letters[s[i]-'a']++;
}
for(int i = 0; i<t.size(); i++)
{
letters[t[i]-'a']--;
}
for(int i = 0; i<26; i++)
{
if(letters[i])
return false;
}
return true;
}
};
简单题~ 一次AC~