class Solution {
public:
bool CheckPermutation(string s1, string s2) {
if (s1.size() != s2.size())
{
return false;
}
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end());
for (int i = 0; i < s1.size(); i++)
{
if (s1[i] != s2[i])
{
return false;
}
}
return true;
}
};
LeetCode面试题 01.02. 判定是否互为字符重排
猜你喜欢
转载自blog.csdn.net/qq_32862515/article/details/108508730
今日推荐
周排行