题目: 给定一个非空的字符串,判断它是否可以由它的一个子串重复多次构成。给定的字符串只含有小写英文字母,并且长度不超过10000。
示例 1:输入: "abab"
输出: True
解释: 可由子字符串 "ab" 重复两次构成。
示例 2:输入: "aba"
输出: False
示例 3:输入: "abcabcabcabc"
输出: True
解释: 可由子字符串 "abc" 重复四次构成。 (或者子字符串 "abcabc" 重复两次构成。)
答案:public static void main(String[] args) {
System.out.println(repeatedSubstringPattern2("abab"));
System.out.println(repeatedSubstringPattern2("aba"));
System.out.println(repeatedSubstringPattern2("abcabcabcabc"));
System.out.println(repeatedSubstringPattern2("AbcAbcAbcAbc"));
System.out.println("----------Mehtod2-------------");
System.out.println(repeatedSubstringPattern2("abab"));
System.out.println(repeatedSubstringPattern2("aba"));
System.out.println(repeatedSubstringPattern2("abcabcabcabc"));
System.out.println(repeatedSubstringPattern2("AbcAbcAbcAbc"));
}
public static boolean repeatedSubstringPattern(String s) {
String regex = "^[a-z]*$";
if (s.length() > 10000 || !s.matches(regex)) {
return false;
}
return (s + s).substring(1, s.length() * 2 - 1).contains(s);
}
public static boolean repeatedSubstringPattern2(String s) {
String regex = "^[a-z]*$";
if (s.length() > 10000 || !s.matches(regex)) {
return false;
}
int strLength = s.length();
for (int i = 0; i
String substring = s.substring(0, i);
if (s.split(substring).length == 0) {
return true;
}
}
return false;
}