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.)
public class Solution { public boolean repeatedSubstringPattern(String str) { if(str == null || str.length() == 0) return true; for(int i = str.length()/2 ; i >= 1 ; i--){ if(str.length() % i == 0){ int m = str.length()/i; String repeatP = str.substring(0,i); int j = 0; for(; j < m ; j++){ if(!repeatP.equals(str.substring(i*j, i+j*i))) break; } if(j == m) return true; } } return false; } }
459. Repeated Substring Pattern
原文：http://www.cnblogs.com/joannacode/p/6105913.html