Maximum Repeating Substring LeetCode solution in Java

1
class Solution {
2
public int maxRepeating(String s, String w) {
3
if (w.length() > s.length()) return 0;
4
int ans = 0;
5
StringBuilder sb = new StringBuilder("");
6
while (sb.length() <= s.length()) {
7
sb.append(w);
8
if (s.contains(sb)) ans++;
9
else break;
10
}
11
return ans;
12
}
13
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0