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.Given a non-emp
阅读背景：
***剑指offer——Repeated Substring Pattern （自己的笨方法 & KMP算法）
来源：互联网
分享到：
