LeetCode笔记：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.)

大意：

给出一个非空字符串，检查它是否可以由它的子字符串重复组成。你可以假设给出的字符串全部由小写字母组成并且它的长度不超过10000。

例1：

输入：“abab”
输出：True
解释：重复两次子字符串 “ab”。

<