git rename

gdut-yy · gdut-yy · commit efbfada9e683 · 2023-02-13T22:26:41.000+08:00
diff --git a/leetcode-26/src/main/java/Solution2553.java b/leetcode-26/src/main/java/Solution2553.java
@@ -2,7 +2,7 @@
 import java.util.Collections;
 import java.util.List;
 
-public class Solution6303 {
+public class Solution2553 {
     public int[] separateDigits(int[] nums) {
         int len = nums.length;
         List<Integer> list = new ArrayList<>();
@@ -19,7 +19,7 @@ public int[] separateDigits(int[] nums) {
     }
 }
 /*
-6303. 分割数组中数字的数位
+2553. 分割数组中数字的数位
 https://leetcode.cn/problems/separate-the-digits-in-an-array/
 
 第 97 场双周赛 T1。
diff --git a/leetcode-26/src/main/java/Solution2554.java b/leetcode-26/src/main/java/Solution2554.java
@@ -1,7 +1,7 @@
 import java.util.HashSet;
 import java.util.Set;
 
-public class Solution6304 {
+public class Solution2554 {
     public int maxCount(int[] banned, int n, int maxSum) {
         Set<Integer> banSet = new HashSet<>();
         for (int x : banned) {
@@ -22,7 +22,7 @@ public int maxCount(int[] banned, int n, int maxSum) {
     }
 }
 /*
-6304. 从一个范围内选择最多整数 I
+2554. 从一个范围内选择最多整数 I
 https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-i/
 
 第 97 场双周赛 T2。
diff --git a/leetcode-26/src/main/java/Solution2555.java b/leetcode-26/src/main/java/Solution2555.java
@@ -1,4 +1,4 @@
-public class Solution6331 {
+public class Solution2555 {
     public int maximizeWin(int[] prizePositions, int k) {
         int n = prizePositions.length;
 
@@ -19,7 +19,7 @@ public int maximizeWin(int[] prizePositions, int k) {
     }
 }
 /*
-6331. 两个线段获得的最多奖品
+2555. 两个线段获得的最多奖品
 https://leetcode.cn/problems/maximize-win-from-two-segments/
 
 第 97 场双周赛 T3。
diff --git a/leetcode-26/src/main/java/Solution2556.java b/leetcode-26/src/main/java/Solution2556.java
@@ -1,4 +1,4 @@
-public class Solution6305 {
+public class Solution2556 {
     private int[][] grid;
     private int M;
     private int N;
@@ -21,7 +21,7 @@ private boolean dfs(int i, int j) {
     }
 }
 /*
-6305. 二进制矩阵中翻转最多一次使路径不连通
+2556. 二进制矩阵中翻转最多一次使路径不连通
 https://leetcode.cn/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/
 
 第 97 场双周赛 T4。
diff --git a/leetcode-26/src/main/java/Solution2558.java b/leetcode-26/src/main/java/Solution2558.java
@@ -1,7 +1,7 @@
 import java.util.Comparator;
 import java.util.PriorityQueue;
 
-public class Solution6348 {
+public class Solution2558 {
     public long pickGifts(int[] gifts, int k) {
         long sum = 0;
         PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Comparator.reverseOrder());
@@ -19,7 +19,7 @@ public long pickGifts(int[] gifts, int k) {
     }
 }
 /*
-6348. 从数量最多的堆取走礼物
+2558. 从数量最多的堆取走礼物
 https://leetcode.cn/problems/take-gifts-from-the-richest-pile/
 
 第 331 场周赛 T1。
diff --git a/leetcode-26/src/main/java/Solution2559.java b/leetcode-26/src/main/java/Solution2559.java
@@ -1,4 +1,4 @@
-public class Solution6347 {
+public class Solution2559 {
     public int[] vowelStrings(String[] words, int[][] queries) {
         int len = words.length;
         int[] preSum = new int[len + 1];
@@ -25,7 +25,7 @@ private boolean isVowel(char ch) {
     }
 }
 /*
-6347. 统计范围内的元音字符串数
+2559. 统计范围内的元音字符串数
 https://leetcode.cn/problems/count-vowel-strings-in-ranges/
 
 第 331 场周赛 T2。
diff --git a/leetcode-26/src/main/java/Solution2560.java b/leetcode-26/src/main/java/Solution2560.java
@@ -1,6 +1,6 @@
 import java.util.Arrays;
 
-public class Solution6346 {
+public class Solution2560 {
     public int minCapability(int[] nums, int k) {
         int left = Arrays.stream(nums).min().orElseThrow();
         int right = Arrays.stream(nums).max().orElseThrow();
@@ -33,7 +33,7 @@ private boolean checkMid(int[] nums, int k, int mid) {
     }
 }
 /*
-6346. 打家劫舍 IV
+2560. 打家劫舍 IV
 https://leetcode.cn/problems/house-robber-iv/
 
 第 331 场周赛 T3。
diff --git a/leetcode-26/src/main/java/Solution2561.java b/leetcode-26/src/main/java/Solution2561.java
@@ -4,7 +4,7 @@
 import java.util.List;
 import java.util.Map;
 
-public class Solution6345 {
+public class Solution2561 {
     public long minCost(int[] basket1, int[] basket2) {
         int n = basket1.length;
         Map<Integer, Integer> cntMap = new HashMap<>();
@@ -36,7 +36,7 @@ public long minCost(int[] basket1, int[] basket2) {
     }
 }
 /*
-6345. 重排水果
+2561. 重排水果
 https://leetcode.cn/problems/rearranging-fruits/
 
 第 331 场周赛 T4。
diff --git a/leetcode-26/src/test/java/Solution2553Tests.java b/leetcode-26/src/test/java/Solution2553Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6303Tests {
-    private final Solution6303 solution6303 = new Solution6303();
+public class Solution2553Tests {
+    private final Solution2553 solution2553 = new Solution2553();
 
     @Test
     public void example1() {
         int[] nums = {13, 25, 83, 77};
         int[] expected = {1, 3, 2, 5, 8, 3, 7, 7};
-        Assertions.assertArrayEquals(expected, solution6303.separateDigits(nums));
+        Assertions.assertArrayEquals(expected, solution2553.separateDigits(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {7, 1, 3, 9};
         int[] expected = {7, 1, 3, 9};
-        Assertions.assertArrayEquals(expected, solution6303.separateDigits(nums));
+        Assertions.assertArrayEquals(expected, solution2553.separateDigits(nums));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2554Tests.java b/leetcode-26/src/test/java/Solution2554Tests.java
@@ -1,16 +1,16 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6304Tests {
-    private final Solution6304 solution6304 = new Solution6304();
+public class Solution2554Tests {
+    private final Solution2554 solution2554 = new Solution2554();
 
     @Test
     public void example1() {
         int[] banned = {1, 6, 5};
         int n = 5;
         int maxSum = 6;
         int expected = 2;
-        Assertions.assertEquals(expected, solution6304.maxCount(banned, n, maxSum));
+        Assertions.assertEquals(expected, solution2554.maxCount(banned, n, maxSum));
     }
 
     @Test
@@ -19,7 +19,7 @@ public void example2() {
         int n = 8;
         int maxSum = 1;
         int expected = 0;
-        Assertions.assertEquals(expected, solution6304.maxCount(banned, n, maxSum));
+        Assertions.assertEquals(expected, solution2554.maxCount(banned, n, maxSum));
     }
 
     @Test
@@ -28,6 +28,6 @@ public void example3() {
         int n = 7;
         int maxSum = 50;
         int expected = 7;
-        Assertions.assertEquals(expected, solution6304.maxCount(banned, n, maxSum));
+        Assertions.assertEquals(expected, solution2554.maxCount(banned, n, maxSum));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2555Tests.java b/leetcode-26/src/test/java/Solution2555Tests.java
@@ -1,22 +1,22 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6331Tests {
-    private final Solution6331 solution6331 = new Solution6331();
+public class Solution2555Tests {
+    private final Solution2555 solution2555 = new Solution2555();
 
     @Test
     public void example1() {
         int[] prizePositions = {1, 1, 2, 2, 3, 3, 5};
         int k = 2;
         int expected = 7;
-        Assertions.assertEquals(expected, solution6331.maximizeWin(prizePositions, k));
+        Assertions.assertEquals(expected, solution2555.maximizeWin(prizePositions, k));
     }
 
     @Test
     public void example2() {
         int[] prizePositions = {1, 2, 3, 4};
         int k = 0;
         int expected = 2;
-        Assertions.assertEquals(expected, solution6331.maximizeWin(prizePositions, k));
+        Assertions.assertEquals(expected, solution2555.maximizeWin(prizePositions, k));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2556Tests.java b/leetcode-26/src/test/java/Solution2556Tests.java
@@ -1,18 +1,18 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6305Tests {
-    private final Solution6305 solution6305 = new Solution6305();
+public class Solution2556Tests {
+    private final Solution2556 solution2556 = new Solution2556();
 
     @Test
     public void example1() {
         int[][] grid = UtUtils.stringToInts2("[[1,1,1],[1,0,0],[1,1,1]]");
-        Assertions.assertTrue(solution6305.isPossibleToCutPath(grid));
+        Assertions.assertTrue(solution2556.isPossibleToCutPath(grid));
     }
 
     @Test
     public void example2() {
         int[][] grid = UtUtils.stringToInts2("[[1,1,1],[1,0,1],[1,1,1]]");
-        Assertions.assertFalse(solution6305.isPossibleToCutPath(grid));
+        Assertions.assertFalse(solution2556.isPossibleToCutPath(grid));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2558Tests.java b/leetcode-26/src/test/java/Solution2558Tests.java
@@ -1,22 +1,22 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6348Tests {
-    private final Solution6348 solution6348 = new Solution6348();
+public class Solution2558Tests {
+    private final Solution2558 solution2558 = new Solution2558();
 
     @Test
     public void example1() {
         int[] gifts = {25, 64, 9, 4, 100};
         int k = 4;
         long expected = 29;
-        Assertions.assertEquals(expected, solution6348.pickGifts(gifts, k));
+        Assertions.assertEquals(expected, solution2558.pickGifts(gifts, k));
     }
 
     @Test
     public void example2() {
         int[] gifts = {1, 1, 1, 1};
         int k = 4;
         long expected = 4;
-        Assertions.assertEquals(expected, solution6348.pickGifts(gifts, k));
+        Assertions.assertEquals(expected, solution2558.pickGifts(gifts, k));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2559Tests.java b/leetcode-26/src/test/java/Solution2559Tests.java
@@ -1,22 +1,22 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6347Tests {
-    private final Solution6347 solution6347 = new Solution6347();
+public class Solution2559Tests {
+    private final Solution2559 solution2559 = new Solution2559();
 
     @Test
     public void example1() {
         String[] words = {"aba", "bcb", "ece", "aa", "e"};
         int[][] queries = UtUtils.stringToInts2("[[0,2],[1,4],[1,1]]");
         int[] expected = {2, 3, 0};
-        Assertions.assertArrayEquals(expected, solution6347.vowelStrings(words, queries));
+        Assertions.assertArrayEquals(expected, solution2559.vowelStrings(words, queries));
     }
 
     @Test
     public void example2() {
         String[] words = {"a", "e", "i"};
         int[][] queries = UtUtils.stringToInts2("[[0,2],[0,1],[2,2]]");
         int[] expected = {3, 2, 1};
-        Assertions.assertArrayEquals(expected, solution6347.vowelStrings(words, queries));
+        Assertions.assertArrayEquals(expected, solution2559.vowelStrings(words, queries));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2560Tests.java b/leetcode-26/src/test/java/Solution2560Tests.java
@@ -1,22 +1,22 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6346Tests {
-    private final Solution6346 solution6346 = new Solution6346();
+public class Solution2560Tests {
+    private final Solution2560 solution2560 = new Solution2560();
 
     @Test
     public void example1() {
         int[] nums = {2, 3, 5, 9};
         int k = 2;
         int expected = 5;
-        Assertions.assertEquals(expected, solution6346.minCapability(nums, k));
+        Assertions.assertEquals(expected, solution2560.minCapability(nums, k));
     }
 
     @Test
     public void example2() {
         int[] nums = {2, 7, 9, 3, 1};
         int k = 2;
         int expected = 2;
-        Assertions.assertEquals(expected, solution6346.minCapability(nums, k));
+        Assertions.assertEquals(expected, solution2560.minCapability(nums, k));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2561Tests.java b/leetcode-26/src/test/java/Solution2561Tests.java
@@ -1,23 +1,23 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6345Tests {
-    private final Solution6345 solution6345 = new Solution6345();
+public class Solution2561Tests {
+    private final Solution2561 solution2561 = new Solution2561();
 
     @Test
     public void example1() {
         int[] basket1 = {4, 2, 2, 2};
         int[] basket2 = {1, 4, 1, 2};
         long expected = 1;
-        Assertions.assertEquals(expected, solution6345.minCost(basket1, basket2));
+        Assertions.assertEquals(expected, solution2561.minCost(basket1, basket2));
     }
 
     @Test
     public void example2() {
         int[] basket1 = {2, 3, 4, 1};
         int[] basket2 = {3, 2, 5, 1};
         long expected = -1;
-        Assertions.assertEquals(expected, solution6345.minCost(basket1, basket2));
+        Assertions.assertEquals(expected, solution2561.minCost(basket1, basket2));
     }
 
     // 补充用例
@@ -28,6 +28,6 @@ public void example3() {
         int[] basket1 = {84, 80, 43, 8, 80, 88, 43, 14, 100, 88};
         int[] basket2 = {32, 32, 42, 68, 68, 100, 42, 84, 14, 8};
         long expected = 48;
-        Assertions.assertEquals(expected, solution6345.minCost(basket1, basket2));
+        Assertions.assertEquals(expected, solution2561.minCost(basket1, basket2));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6331 {`
	`1`	`+public class Solution2555 {`
`2`	`2`	`public int maximizeWin(int[] prizePositions, int k) {`
`3`	`3`	`int n = prizePositions.length;`
`4`	`4`
`@@ -19,7 +19,7 @@ public int maximizeWin(int[] prizePositions, int k) {`
`19`	`19`	`}`
`20`	`20`	`}`
`21`	`21`	`/*`
`22`		`-6331. 两个线段获得的最多奖品`
	`22`	`+2555. 两个线段获得的最多奖品`
`23`	`23`	`https://leetcode.cn/problems/maximize-win-from-two-segments/`
`24`	`24`
`25`	`25`	`第 97 场双周赛 T3。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6305 {`
	`1`	`+public class Solution2556 {`
`2`	`2`	`private int[][] grid;`
`3`	`3`	`private int M;`
`4`	`4`	`private int N;`
`@@ -21,7 +21,7 @@ private boolean dfs(int i, int j) {`
`21`	`21`	`}`
`22`	`22`	`}`
`23`	`23`	`/*`
`24`		`-6305. 二进制矩阵中翻转最多一次使路径不连通`
	`24`	`+2556. 二进制矩阵中翻转最多一次使路径不连通`
`25`	`25`	`https://leetcode.cn/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/`
`26`	`26`
`27`	`27`	`第 97 场双周赛 T4。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6347 {`
	`1`	`+public class Solution2559 {`
`2`	`2`	`public int[] vowelStrings(String[] words, int[][] queries) {`
`3`	`3`	`int len = words.length;`
`4`	`4`	`int[] preSum = new int[len + 1];`
`@@ -25,7 +25,7 @@ private boolean isVowel(char ch) {`
`25`	`25`	`}`
`26`	`26`	`}`
`27`	`27`	`/*`
`28`		`-6347. 统计范围内的元音字符串数`
	`28`	`+2559. 统计范围内的元音字符串数`
`29`	`29`	`https://leetcode.cn/problems/count-vowel-strings-in-ranges/`
`30`	`30`
`31`	`31`	`第 331 场周赛 T2。`
Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`import java.util.Arrays;`
`2`	`2`
`3`		`-public class Solution6346 {`
	`3`	`+public class Solution2560 {`
`4`	`4`	`public int minCapability(int[] nums, int k) {`
`5`	`5`	`int left = Arrays.stream(nums).min().orElseThrow();`
`6`	`6`	`int right = Arrays.stream(nums).max().orElseThrow();`
`@@ -33,7 +33,7 @@ private boolean checkMid(int[] nums, int k, int mid) {`
`33`	`33`	`}`
`34`	`34`	`}`
`35`	`35`	`/*`
`36`		`-6346. 打家劫舍 IV`
	`36`	`+2560. 打家劫舍 IV`
`37`	`37`	`https://leetcode.cn/problems/house-robber-iv/`
`38`	`38`
`39`	`39`	`第 331 场周赛 T3。`