题目来源
leetcode
题目描述
题目解析
模拟
class Solution {
public:
bool isFlipedString(string s1, string s2) {
int n1 = s1.size(), n2 = s2.size();
if(n1 != n2){
return false;
}
if(n2 == 0){
return true;
}
for (int i = 0; i < n1; ++i) {
bool flag = true;
for (int j = 0; j < n2; ++j) {
if (s1[(i + j) % n2] != s2[j]) {
flag = false;
break;
}
}
if(flag){
return true;
}
}
return false;
}
};
搜索子字符串
public static boolean isFlipedString(String s1, String s2) {
if (s1.length() != s2.length()){
return false;
}
String s = s2 + s2;
return s.contains(s1);
}
class Solution {
public:
bool isFlipedString(string s1, string s2) {
return s1.size() == s2.size() && (s1 + s1).find(s2) != std::string::npos;
}
};