class Solution {
public:
bool isFlipedString(string s1, string s2) {
if(s1.size() == 0 && s2.size() == 0)
{
return true;
}
if(s1.size() != 0 && s2.size() == 0)
{
return false;
}
if(s1.size() == 0 && s2.size() != 0)
{
return false;
}
return ((s1 + s1).find(s2) == string::npos) ? false : true;
}
};
leetcode | 面试题 01.09. 字符串轮转
最新推荐文章于 2024-04-05 15:23:18 发布