refactor 686

fishercoder1534 · fishercoder1534 · commit d724ebec7e0e · 2020-07-21T06:19:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_686.java b/src/main/java/com/fishercoder/solutions/_686.java
@@ -3,19 +3,6 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**
- * 686. Repeated String Match
- *
- * Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it.
- * If no such solution, return -1.
- * For example, with A = "abcd" and B = "cdabcdab".
- * Return 3, because by repeating A three times (“abcdabcdabcd”),
- * B is a substring of it; and B is not a substring of A repeated two times ("abcdabcd").
-
- Note:
- The length of A and B will be between 1 and 10000.
- */
-
 public class _686 {
     public static class Solution1 {
         public int repeatedStringMatch(String A, String B) {
@@ -43,7 +30,7 @@ public static class Solution2 {
         /**
          * Time: O(N(N+M))
          * Space: O(N + M)
-         * */
+         */
         public int repeatedStringMatch(String A, String B) {
             int count = 1;
             StringBuilder sb = new StringBuilder(A);
