//暴力求解
class Solution {
public:
bool repeatedSubstringPattern(string s) {
int sublength = 1;//子串的长度,初始为1
int flag = 1;
while (sublength <= s.length() / 2)
{
if (s.length() % sublength == 0)
{
for (int i = 0; i < s.length(); i += sublength)
{
for (int j = 0; j < sublength; j++)
{
if (s[j] != s[i + j])
{
flag = 0;
break;
}
}
}
if(flag == 1)
return true;
}
sublength++;
flag = 1;
}
return false;
}
};
leetcode-19. 删除链表的倒数第 N 个结点
最新推荐文章于 2024-07-19 19:25:43 发布