add 1668

fishercoder1534 · fishercoder1534 · commit 65435643cb5b · 2020-11-28T10:11:10.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) ||Easy|String|
 |1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)|[Javascript](./javascript/_1664.js) ||Medium|Greedy|
 |1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) ||Medium|Greedy|
 |1662|[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1668.java b/src/main/java/com/fishercoder/solutions/_1668.java
@@ -0,0 +1,15 @@
+package com.fishercoder.solutions;
+
+public class _1668 {
+    public static class Solution1 {
+        public int maxRepeating(String sequence, String word) {
+            StringBuilder sb = new StringBuilder(word);
+            int times = 0;
+            while (sequence.indexOf(sb.toString()) != -1) {
+                times++;
+                sb.append(word);
+            }
+            return times;
+        }
+    }
+}
