459. Repeated Substring Pattern

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.)

最基本的思路是

当重复的个数是1时，分别遍历余下的每1个看是否相同。

当重复的个数是2时，分别遍历余下的每2个看是否相同。

当重复的个数是3时，分别遍历余下的每3个看是否相同。

当重复的个数是n/2时，分别遍历余下的每n/2个看是否相同。

...

class Solution {
public:
    bool repeatedSubstringPattern(string s) {
        int n=s.length(),i,j;
        string a;
        int ans=0;
        for(i=1;i<=n/2;i++){
            if(n%i==0){
                a=s.substr(0,i);
                for(j=1;j<n/i;j++){
                    if(a!=s.substr(j*i,i)){
                        break;
                    }
                }
                if(j==n/i){
                    ans=1;break;
                }
            }
        }
        return ans;
    }
};