43. leetcode 459. Repeated Substring Pattern

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

 

思路：从第一个字符开始，以一定步长，看以此为步长的子串是不是符合要求的模式串。 　　

 

转载于:https://www.cnblogs.com/vincent93/p/6686645.html

相关资源：JAVA上百实例源码以及开源项目