标签：row let question example 重复 string nbsp exce str
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.)
s
[LeetCode] Repeated Substring Pattern 重复子字符串模式
标签：row let question example 重复 string nbsp exce str
原文地址：http://www.cnblogs.com/grandyang/p/6087347.html
