Given two strings s and t, write a function to determine if t is an anagram of s.
看一个数是不是另一个数的anagram
anagram :组成元素相同,但顺序不同
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?
如果你的字符串中有 unicode 字符,可以解决吗?
思路1
排序然后比较
class Solution {
public:
bool isAnagram(string s, string t) {
sort(s.begin(), s.end());
sort(t.begin(), t.end());
return s==t;
}
};
思路2
利用数组计数可以判断元素想等问题
class Solution {
public:
bool isAnagram(string s, string t) {
vector<int> v(26,0);
for(int i=0; i<s.size(); i++)
{
v[s[i]-'a']++;
}
for(int i=0; i<t.size(); i++)
{
v[t[i]-'a']--;
}
for(int i=0; i<26; i++)
if(v[i]!=0)
return 0;
return 1;
}
};