publicbooleanrepeatedSubstringPattern3(String s){intlen=s.length();if(len <2) {returnfalse; }charlastChar=s.charAt(len-1);intindex=s.indexOf(lastChar);// 思想是: 找到最后一个字符所在的位置,那么如果是pattern,则一定有// len%(index+1)== 0。 那么pattern应该是从0到index位置的子串。while...
publicbooleanrepeatedSubstringPattern(String str) { intn = str.length(); for(inti=n/2;i>=1;i--) { if(n%i==0) { intm = n/i; String substring = str.substring(0,i); StringBuilder sb =newStringBuilder(); for(intj=0;j<m;j++) { sb.append(substring); } if(sb.toString().equal...
class Solution { public boolean repeatedSubstringPattern(String s) { for (int len = 1; len <= s.length() / 2; len++) { String str = s.substring(0, len); if (s.length() % str.length() != 0) { continue; } if (repeatedSubstring(str, s.length() / str.length()).equals(s)...
459. Repeated Substring Pattern 重复的子字符串 给定一个非空的字符串,判断它是否可以由它的一个子串重复多次构成。给定的字符串只含有小写英文字母,并且长度不超过10000。 示例1: 输入:"abab"输出:True解释:可由子字符串 "ab" 重复两次构成。 1. 2. 3. 4. 5. 示例2: 输入:"aba"输出:False 1. 2. ...
publicclassSolution{publicbooleanrepeatedSubstringPattern(Stringstr){if(str.length()<2)returnfalse;char[]arr=str.toCharArray();intlow=0;intfast=1;booleanmatch=false;// 匹配到与否的标记while(fast<arr.length){if(arr[fast]==arr[0]){// 匹配到了第一个,开始判断是否重复for(low=0;fast<arr.lengt...
Golang Leetcode 459. Repeated Substring Pattern.go 思路 有一个神奇的解法: 用两个s 首尾相连得到一个新的字符串ss ; 去掉ss 的首尾两个字符; 如果在剩下来的字符串中能找到s 那么返回True,否则False if len(s) == 0 { return false } ss := (s + s)1:(len(s)*2)-1 return strings....
459. Repeated Substring Patter classSolution(object):defrepeatedSubstringPattern(self,s):""":type s: str:rtype: bool"""# 此题需要KMP算法基础# 直接利用KMP算法的next数组求,但比KMP算法中next数组(又称部分匹配表)多加一位# 例如长度为5的子串重复4次,那next总长度为21的最后一个元素是15nex=self....
classSolution{publicbooleanrepeatedSubstringPattern(Strings){intlen=s.length();for(inti=1;i<=len/2;i++){Stringsub=s.substring(0,i);StringBuffersb=newStringBuffer();for(intj=0;j<len/i;j++){sb.append(sub);}if(sb.toString().equals(s)){returntrue;}}returnfalse;}} ...
finally check if the substring append len/i times equals the s 代码 publicbooleanrepeatedSubstringPattern(Strings) {if(s ==null|| s.length() ==0)returnfalse;intlen = s.length();for(inti =1; i <= len/2; i++){if(len % i ==0){intsubStrLen = len/i; ...
feat: add Repeated Substring Pattern dfea5dd jizzel merged commit 60de0d4 into main Aug 21, 2024 jizzel deleted the day4-java branch August 21, 2024 21:37 Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment Reviewers No reviews Ass...