add skeleton for 1062

fishercoder1534 · fishercoder1534 · commit 9b80f0e30855 · 2020-02-01T12:53:31.000-08:00
diff --git a/README.md b/README.md
@@ -67,6 +67,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | |Easy||
 |1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) |  |Easy||
 |1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | |Medium||
+|1062|[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | |Medium||
 |1056|[Confusing Number](https://leetcode.com/problems/confusing-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | |Easy||
 |1055|[Fixed Point](https://leetcode.com/problems/fixed-point/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) |  |Easy||
 |1051|[Height Checker](https://leetcode.com/problems/height-checker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1062.java b/src/main/java/com/fishercoder/solutions/_1062.java
@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1062. Longest Repeating Substring
+ *
+ * Given a string S, find out the length of the longest repeating substring(s). Return 0 if no repeating substring exists.
+ *
+ * Example 1:
+ * Input: "abcd"
+ * Output: 0
+ * Explanation: There is no repeating substring.
+ *
+ * Example 2:
+ * Input: "abbaba"
+ * Output: 2
+ * Explanation: The longest repeating substrings are "ab" and "ba", each of which occurs twice.
+ *
+ * Example 3:
+ * Input: "aabcaabdaab"
+ * Output: 3
+ * Explanation: The longest repeating substring is "aab", which occurs 3 times.
+ *
+ * Example 4:
+ * Input: "aaaaa"
+ * Output: 4
+ * Explanation: The longest repeating substring is "aaaa", which occurs twice.
+ *
+ * Note:
+ * The string S consists of only lowercase English letters from 'a' - 'z'.
+ * 1 <= S.length <= 1500
+ * */
+public class _1062 {
+    public static class Solution1 {
+        public int longestRepeatingSubstring(String S) {
+            //TODO: implement it
+            return 0;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1062Test.java b/src/test/java/com/fishercoder/_1062Test.java
@@ -0,0 +1,43 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1062;
+import org.junit.BeforeClass;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+@Ignore
+public class _1062Test {
+    private static _1062.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1062.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(0, (solution1.longestRepeatingSubstring("abcd")));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, (solution1.longestRepeatingSubstring("abbaba")));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(3, (solution1.longestRepeatingSubstring("aabcaabdaab")));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(4, (solution1.longestRepeatingSubstring("aaaaa")));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(10, (solution1.longestRepeatingSubstring("aaabaabbbaaabaabbaabbbabbbaaaabbaaaaaabbbaabbbbbbbbbaaaabbabbaba")));
+    }
+}
