refactor 1065

fishercoder1534 · fishercoder1534 · commit 8ddf26dacc62 · 2019-06-02T08:35:38.000-07:00
diff --git a/README.md b/README.md
@@ -27,7 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
-|1056|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | O(nlogn) | O(1) | |Medium||
+|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) | O(nlogn) | O(1) | |Medium||
 |1055|[Fixed Point](https://leetcode.com/problems/fixed-point/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | O(n) | O(1) | |Easy||
 |1051|[Height Checker](https://leetcode.com/problems/height-checker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | O(nlogn) | O(1) | |Easy||
 |1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | O(n) | O(1) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1065.java b/src/main/java/com/fishercoder/solutions/_1065.java
@@ -6,7 +6,7 @@
 import java.util.List;
 
 /**
- * 1056. Index Pairs of a String
+ * 1065. Index Pairs of a String
  *
  * Given a text string and words (a list of strings),
  * return all index pairs [i, j] so that the substring text[i]...text[j] is in the list of words.
@@ -30,7 +30,7 @@
  * 1 <= words[i].length <= 50
  * Return the pairs [i,j] in sorted order (i.e. sort them by their first coordinate in case of ties sort them by their second coordinate).
  * */
-public class _1056 {
+public class _1065 {
     public static class Solution1 {
         public int[][] indexPairs(String text, String[] words) {
             List<List<Integer>> lists = new ArrayList<>();
diff --git a/src/test/java/com/fishercoder/_1065Test.java b/src/test/java/com/fishercoder/_1065Test.java
@@ -1,16 +1,16 @@
 package com.fishercoder;
 
 import com.fishercoder.common.utils.CommonUtils;
-import com.fishercoder.solutions._1056;
+import com.fishercoder.solutions._1065;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
-public class _1056Test {
-    private static _1056.Solution1 solution1;
+public class _1065Test {
+    private static _1065.Solution1 solution1;
 
     @BeforeClass
     public static void setup() {
-        solution1 = new _1056.Solution1();
+        solution1 = new _1065.Solution1();
     }
 
     @Test
