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.
思路:
了解题目的意思是什么。其实就是说字符串s和t的字符是否是打乱的。用hash-map就可以很快地解答。
class Solution {
public:
bool isAnagram(string s, string t) {
int l1 = s.length();
int l2 = t.length();
if(l1 != l2) return false;
map<int, int> str1, str2;
for(int i = 0; i < l1; i++)
{
str1[s[i]-'a']++;
}
for(int i = 0; i < l2; i++)
{
str2[t[i]-'a']++;
}
for(int i = 0; i < 26; i++)
{
if(str1[i] != str2[i]) return false;
}
return true;
}
};