Open Shawngbk opened 7 years ago
public class Solution { public boolean repeatedSubstringPattern(String str) { int len = str.length(); for(int i = len/2; i > 0; i--) { if(len%i == 0) { //i是最小字串的长度，一定会被len整除 int m = len/i; String sub = str.substring(0, i); StringBuilder sb = new StringBuilder(); //构造一个字符串，粘贴m个sub，如果等于str就是true for(int j = 0; j < m; j++) { sb.append(sub); } if(sb.toString().equals(str)) return true; } } return false; } }
Amazon google
Shawngbk
commented
7 years ago Shawngbk
commented
7 years ago
public class Solution { public boolean repeatedSubstringPattern(String str) { int len = str.length(); for(int i = len/2; i > 0; i--) { if(len%i == 0) { //i是最小字串的长度，一定会被len整除 int m = len/i; String sub = str.substring(0, i); StringBuilder sb = new StringBuilder(); //构造一个字符串，粘贴m个sub，如果等于str就是true for(int j = 0; j < m; j++) { sb.append(sub); } if(sb.toString().equals(str)) return true; } } return false; } }