Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.
Example 1:
Input: "abab"
Output: True
Explanation: It's the substring "ab" twice.
Example 2:
Input: "aba"
Output: False
Example 3:
Input: "abcabcabcabc"
Output: True
Explanation: It's the substring "abc" four times. (And the substring "abcabc" twice.)
给定一个没有空格的的字符串,查看该字符串是否由其中的一个子串重复多次得到。给定的字符串中只有小写的英文字母,而且长度不超过10000.
例子 1:
输入: "abab"
输出: True
解释:这是由子串"ab"重复得到
例子 2:
输入: "aba"
输出: False
例子3 3:
输入: "abcabcabcabc"
输出: True
解释:这是由子串"abc"重复四次得到的,也可以认为是"abcabc重复两次得到的"
Solution:
1. 暴力法:首先通过所给字符串长度枚举出可以作为重复子串的字符串长度,在每个枚举中,分别判断是否满足题意。
bool repeatedSubstringPattern(string str) {
int len = str.size();
for (int i = 1; i <= len / 2; i++) {
if (len % i == 0) {
string sub = str.substr(0, i);
int j;
for (j = 1; j < len / i; j++) {
if (sub != str.substr(i * j, i*(j+1))) {
break;
}
}
if (j == len / i)
return true;
}
}
return false;
}
2. 简便运算:将两个所给字符串s1首尾相连组成新的字符串s2 = s1 + s1,将s2首尾字符去掉变为字符串s3。
若s1为满足题意的字符串,s3中必存在s1。
class Solution {
public:
bool repeatedSubstringPattern(string str) {
int len = str.size();
string newStr = str + str;
newStr = newStr.substr(1, 2 * len - 2);
return newStr.find(str) != -1;
}
};
3,基于KMP思想做的,时间复杂性比较好
bool repeatedSubstringPattern(string str)
{
int i = 1, j = 0, n = str.size();
vector<int> dp(n+1,0);
while( i < str.size() )
{ if( str[i] == str[j] )
dp[++i]=++j;
else if( j == 0 ) i++;
else j = dp[j]; }
return dp[n]&&dp[n]%(n-dp[n])==0;
}