update 1062

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/secondthousand/_1062.java

@@ -6,15 +6,17 @@
 public class _1062 {
     public static class Solution1 {
         /**
-         * My completely original, although brute-force solution, on 1/20/2022.
+         * My completely original solution, although kind of brute-force, on 1/20/2022.
+         * Two pointer technique:
+         * j starts from the right, i starts from the left,
+         * as soon as we are able to find a repeated substring, we return.
          */
         public int longestRepeatingSubstring(String s) {
             Set<String> seen = new HashSet<>();
             for (int j = s.length() - 1; j > 0; j--) {
-                int len = j;
-                for (int i = 0; i <= s.length() - j; i++) {
-                    if (!seen.add(s.substring(i, i + len))) {
-                        return len;
+                for (int i = 0; i + j <= s.length(); i++) {
+                    if (!seen.add(s.substring(i, i + j))) {
+                        return j;
                     }
                 }
                 seen.clear();

src/test/java/com/fishercoder/secondthousand/_1062Test.java

@@ -1,16 +1,16 @@
 package com.fishercoder.secondthousand;
 
 import com.fishercoder.solutions.secondthousand._1062;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
-import static org.junit.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class _1062Test {
     private static _1062.Solution1 solution1;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         solution1 = new _1062.Solution1();
     }