Skip to content

Commit 8ddf26d

Browse files
refactor 1065
1 parent 0ab6d0b commit 8ddf26d

File tree

3 files changed

+7
-7
lines changed

3 files changed

+7
-7
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
2727

2828
| # | Title | Solutions | Time | Space | Video | Difficulty | Tag
2929
|-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
30-
|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||
30+
|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||
3131
|1055|[Fixed Point](https://leetcode.com/problems/fixed-point/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | O(n) | O(1) | |Easy||
3232
|1051|[Height Checker](https://leetcode.com/problems/height-checker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | O(nlogn) | O(1) | |Easy||
3333
|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||

src/main/java/com/fishercoder/solutions/_1056.java renamed to src/main/java/com/fishercoder/solutions/_1065.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
import java.util.List;
77

88
/**
9-
* 1056. Index Pairs of a String
9+
* 1065. Index Pairs of a String
1010
*
1111
* Given a text string and words (a list of strings),
1212
* return all index pairs [i, j] so that the substring text[i]...text[j] is in the list of words.
@@ -30,7 +30,7 @@
3030
* 1 <= words[i].length <= 50
3131
* 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).
3232
* */
33-
public class _1056 {
33+
public class _1065 {
3434
public static class Solution1 {
3535
public int[][] indexPairs(String text, String[] words) {
3636
List<List<Integer>> lists = new ArrayList<>();

src/test/java/com/fishercoder/_1056Test.java renamed to src/test/java/com/fishercoder/_1065Test.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,16 @@
11
package com.fishercoder;
22

33
import com.fishercoder.common.utils.CommonUtils;
4-
import com.fishercoder.solutions._1056;
4+
import com.fishercoder.solutions._1065;
55
import org.junit.BeforeClass;
66
import org.junit.Test;
77

8-
public class _1056Test {
9-
private static _1056.Solution1 solution1;
8+
public class _1065Test {
9+
private static _1065.Solution1 solution1;
1010

1111
@BeforeClass
1212
public static void setup() {
13-
solution1 = new _1056.Solution1();
13+
solution1 = new _1065.Solution1();
1414
}
1515

1616
@Test

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy