Given twostrings s and t, write a function to determine if t isan 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.
思路:
1) 将字符串s和t按照字母排序;
2) 比较排序后的字符串是否相同,是则返回true;否则返回false。
Tips:
借助函数std::sort()和string::compare()。
template< class RandomIt >
void sort( RandomIt first, RandomIt last );
class Solution {
public:
bool isAnagram(string s, string t) {
int slen = s.length();
int tlen = t.length();
if(slen == 0 || tlen== 0)
{
if(slen == tlen) return true;
else return false;
}
sort(s.begin(), s.end());
sort(t.begin(), t.end());
if(s.compare(t) == 0)
return true;
else
return false;
}
};