git rename

gdut-yy · gdut-yy · commit 931f55cc8b9f · 2023-02-25T23:04:51.000+08:00
diff --git a/leetcode-26/src/main/java/Solution2566.java b/leetcode-26/src/main/java/Solution2566.java
@@ -1,4 +1,4 @@
-public class Solution6359 {
+public class Solution2566 {
     public int minMaxDifference(int num) {
         int min = Integer.MAX_VALUE;
         int max = 0;
@@ -15,7 +15,7 @@ public int minMaxDifference(int num) {
     }
 }
 /*
-6359. 替换一个数字后的最大差值
+2566. 替换一个数字后的最大差值
 https://leetcode.cn/problems/maximum-difference-by-remapping-a-digit/
 
 第 98 场双周赛 T1。
diff --git a/leetcode-26/src/main/java/Solution2567.java b/leetcode-26/src/main/java/Solution2567.java
@@ -1,6 +1,6 @@
 import java.util.Arrays;
 
-public class Solution6361 {
+public class Solution2567 {
     public int minimizeSum(int[] nums) {
         int n = nums.length;
         Arrays.sort(nums);
@@ -12,7 +12,7 @@ public int minimizeSum(int[] nums) {
     }
 }
 /*
-6361. 修改两个元素的最小分数
+2567. 修改两个元素的最小分数
 https://leetcode.cn/problems/minimum-score-by-changing-two-elements/
 
 第 98 场双周赛 T2。
diff --git a/leetcode-26/src/main/java/Solution2568.java b/leetcode-26/src/main/java/Solution2568.java
@@ -1,7 +1,7 @@
 import java.util.HashSet;
 import java.util.Set;
 
-public class Solution6360 {
+public class Solution2568 {
     public int minImpossibleOR(int[] nums) {
         Set<Integer> set = new HashSet<>();
         for (int x : nums) {
@@ -18,7 +18,7 @@ public int minImpossibleOR(int[] nums) {
     }
 }
 /*
-6360. 最小无法得到的或值
+2568. 最小无法得到的或值
 https://leetcode.cn/problems/minimum-impossible-or/
 
 给你一个下标从 0 开始的整数数组 nums 。
diff --git a/leetcode-26/src/main/java/Solution2569.java b/leetcode-26/src/main/java/Solution2569.java
@@ -1,7 +1,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-public class Solution6358 {
+public class Solution2569 {
     public long[] handleQuery(int[] nums1, int[] nums2, int[][] queries) {
         long sum2 = 0L;
         for (int x : nums2) {
@@ -109,7 +109,7 @@ private void pushUp(int p) {
     }
 }
 /*
-6358. 更新数组后处理求和查询
+2569. 更新数组后处理求和查询
 https://leetcode.cn/problems/handling-sum-queries-after-update/
 
 第 98 场双周赛 T4。
diff --git a/leetcode-26/src/main/java/Solution2570.java b/leetcode-26/src/main/java/Solution2570.java
@@ -1,7 +1,7 @@
 import java.util.Map;
 import java.util.TreeMap;
 
-public class Solution6362 {
+public class Solution2570 {
     public int[][] mergeArrays(int[][] nums1, int[][] nums2) {
         TreeMap<Integer, Integer> treeMap = new TreeMap<>();
         for (int[] x : nums1) {
@@ -20,7 +20,7 @@ public int[][] mergeArrays(int[][] nums1, int[][] nums2) {
     }
 }
 /*
-6362. 合并两个二维数组 - 求和法
+2570. 合并两个二维数组 - 求和法
 https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/
 
 第 333 场周赛 T1。
diff --git a/leetcode-26/src/main/java/Solution2571.java b/leetcode-26/src/main/java/Solution2571.java
@@ -1,7 +1,7 @@
 import java.util.LinkedList;
 import java.util.Queue;
 
-public class Solution6365 {
+public class Solution2571 {
     public int minOperations(int n) {
         Queue<Integer> queue = new LinkedList<>();
         queue.add(n);
@@ -31,7 +31,7 @@ public int minOperations(int n) {
     }
 }
 /*
-6365. 将整数减少到零需要的最少操作数
+2571. 将整数减少到零需要的最少操作数
 https://leetcode.cn/problems/minimum-operations-to-reduce-an-integer-to-0/
 
 给你一个正整数 n ，你可以执行下述操作 任意 次：
diff --git a/leetcode-26/src/main/java/Solution2572.java b/leetcode-26/src/main/java/Solution2572.java
@@ -1,4 +1,4 @@
-public class Solution6364 {
+public class Solution2572 {
     private static final int[] PRIMES = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
     private static final int MAX_N = 30;
     private static final int MOD = (int) (1e9 + 7);
@@ -55,7 +55,7 @@ public int squareFreeSubsets(int[] nums) {
     }
 }
 /*
-6364. 无平方子集计数
+2572. 无平方子集计数
 https://leetcode.cn/problems/count-the-number-of-square-free-subsets/
 
 第 333 场周赛 T3。
diff --git a/leetcode-26/src/main/java/Solution2573.java b/leetcode-26/src/main/java/Solution2573.java
@@ -1,4 +1,4 @@
-public class Solution6363 {
+public class Solution2573 {
     public String findTheString(int[][] lcp) {
         int n = lcp.length;
         char[] chars = new char[n];
@@ -42,7 +42,7 @@ public String findTheString(int[][] lcp) {
     }
 }
 /*
-6363. 找出对应 LCP 矩阵的字符串
+2573. 找出对应 LCP 矩阵的字符串
 https://leetcode.cn/problems/find-the-string-with-lcp/
 
 第 333 场周赛 T4。
diff --git a/leetcode-26/src/test/java/Solution2566Tests.java b/leetcode-26/src/test/java/Solution2566Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6359Tests {
-    private final Solution6359 solution6359 = new Solution6359();
+public class Solution2566Tests {
+    private final Solution2566 solution2566 = new Solution2566();
 
     @Test
     public void example1() {
         int num = 11891;
         int expected = 99009;
-        Assertions.assertEquals(expected, solution6359.minMaxDifference(num));
+        Assertions.assertEquals(expected, solution2566.minMaxDifference(num));
     }
 
     @Test
     public void example2() {
         int num = 90;
         int expected = 99;
-        Assertions.assertEquals(expected, solution6359.minMaxDifference(num));
+        Assertions.assertEquals(expected, solution2566.minMaxDifference(num));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2567Tests.java b/leetcode-26/src/test/java/Solution2567Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6361Tests {
-    private final Solution6361 solution6361 = new Solution6361();
+public class Solution2567Tests {
+    private final Solution2567 solution2567 = new Solution2567();
 
     @Test
     public void example1() {
         int[] nums = {1, 4, 3};
         int expected = 0;
-        Assertions.assertEquals(expected, solution6361.minimizeSum(nums));
+        Assertions.assertEquals(expected, solution2567.minimizeSum(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {1, 4, 7, 8, 5};
         int expected = 3;
-        Assertions.assertEquals(expected, solution6361.minimizeSum(nums));
+        Assertions.assertEquals(expected, solution2567.minimizeSum(nums));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2568Tests.java b/leetcode-26/src/test/java/Solution2568Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6360Tests {
-    private final Solution6360 solution6360 = new Solution6360();
+public class Solution2568Tests {
+    private final Solution2568 solution2568 = new Solution2568();
 
     @Test
     public void example1() {
         int[] nums = {2, 1};
         int expected = 4;
-        Assertions.assertEquals(expected, solution6360.minImpossibleOR(nums));
+        Assertions.assertEquals(expected, solution2568.minImpossibleOR(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {5, 3, 2};
         int expected = 1;
-        Assertions.assertEquals(expected, solution6360.minImpossibleOR(nums));
+        Assertions.assertEquals(expected, solution2568.minImpossibleOR(nums));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2569Tests.java b/leetcode-26/src/test/java/Solution2569Tests.java
@@ -1,16 +1,16 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6358Tests {
-    private final Solution6358 solution6358 = new Solution6358();
+public class Solution2569Tests {
+    private final Solution2569 solution2569 = new Solution2569();
 
     @Test
     public void example1() {
         int[] nums1 = {1, 0, 1};
         int[] nums2 = {0, 0, 0};
         int[][] queries = UtUtils.stringToInts2("[[1,1,1],[2,1,0],[3,0,0]]");
         long[] expected = {3};
-        Assertions.assertArrayEquals(expected, solution6358.handleQuery(nums1, nums2, queries));
+        Assertions.assertArrayEquals(expected, solution2569.handleQuery(nums1, nums2, queries));
     }
 
     @Test
@@ -19,6 +19,6 @@ public void example2() {
         int[] nums2 = {5};
         int[][] queries = UtUtils.stringToInts2("[[2,0,0],[3,0,0]]");
         long[] expected = {5};
-        Assertions.assertArrayEquals(expected, solution6358.handleQuery(nums1, nums2, queries));
+        Assertions.assertArrayEquals(expected, solution2569.handleQuery(nums1, nums2, queries));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2570Tests.java b/leetcode-26/src/test/java/Solution2570Tests.java
@@ -1,22 +1,22 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6362Tests {
-    private final Solution6362 solution6362 = new Solution6362();
+public class Solution2570Tests {
+    private final Solution2570 solution2570 = new Solution2570();
 
     @Test
     public void example1() {
         int[][] nums1 = UtUtils.stringToInts2("[[1,2],[2,3],[4,5]]");
         int[][] nums2 = UtUtils.stringToInts2("[[1,4],[3,2],[4,1]]");
         int[][] expected = UtUtils.stringToInts2("[[1,6],[2,3],[3,2],[4,6]]");
-        Assertions.assertArrayEquals(expected, solution6362.mergeArrays(nums1, nums2));
+        Assertions.assertArrayEquals(expected, solution2570.mergeArrays(nums1, nums2));
     }
 
     @Test
     public void example2() {
         int[][] nums1 = UtUtils.stringToInts2("[[2,4],[3,6],[5,5]]");
         int[][] nums2 = UtUtils.stringToInts2("[[1,3],[4,3]]");
         int[][] expected = UtUtils.stringToInts2("[[1,3],[2,4],[3,6],[4,3],[5,5]]");
-        Assertions.assertArrayEquals(expected, solution6362.mergeArrays(nums1, nums2));
+        Assertions.assertArrayEquals(expected, solution2570.mergeArrays(nums1, nums2));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2571Tests.java b/leetcode-26/src/test/java/Solution2571Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6365Tests {
-    private final Solution6365 solution6365 = new Solution6365();
+public class Solution2571Tests {
+    private final Solution2571 solution2571 = new Solution2571();
 
     @Test
     public void example1() {
         int n = 39;
         int expected = 3;
-        Assertions.assertEquals(expected, solution6365.minOperations(n));
+        Assertions.assertEquals(expected, solution2571.minOperations(n));
     }
 
     @Test
     public void example2() {
         int n = 54;
         int expected = 3;
-        Assertions.assertEquals(expected, solution6365.minOperations(n));
+        Assertions.assertEquals(expected, solution2571.minOperations(n));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2572Tests.java b/leetcode-26/src/test/java/Solution2572Tests.java
@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6364Tests {
-    private final Solution6364 solution6364 = new Solution6364();
+public class Solution2572Tests {
+    private final Solution2572 solution2572 = new Solution2572();
 
     @Test
     public void example1() {
         int[] nums = {3, 4, 4, 5};
         int expected = 3;
-        Assertions.assertEquals(expected, solution6364.squareFreeSubsets(nums));
+        Assertions.assertEquals(expected, solution2572.squareFreeSubsets(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {1};
         int expected = 1;
-        Assertions.assertEquals(expected, solution6364.squareFreeSubsets(nums));
+        Assertions.assertEquals(expected, solution2572.squareFreeSubsets(nums));
     }
 }
diff --git a/leetcode-26/src/test/java/Solution2573Tests.java b/leetcode-26/src/test/java/Solution2573Tests.java
@@ -1,27 +1,27 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6363Tests {
-    private final Solution6363 solution6363 = new Solution6363();
+public class Solution2573Tests {
+    private final Solution2573 solution2573 = new Solution2573();
 
     @Test
     public void example1() {
         int[][] lcp = UtUtils.stringToInts2("[[4,0,2,0],[0,3,0,1],[2,0,2,0],[0,1,0,1]]");
         String expected = "abab";
-        Assertions.assertEquals(expected, solution6363.findTheString(lcp));
+        Assertions.assertEquals(expected, solution2573.findTheString(lcp));
     }
 
     @Test
     public void example2() {
         int[][] lcp = UtUtils.stringToInts2("[[4,3,2,1],[3,3,2,1],[2,2,2,1],[1,1,1,1]]");
         String expected = "aaaa";
-        Assertions.assertEquals(expected, solution6363.findTheString(lcp));
+        Assertions.assertEquals(expected, solution2573.findTheString(lcp));
     }
 
     @Test
     public void example3() {
         int[][] lcp = UtUtils.stringToInts2("[[4,3,2,1],[3,3,2,1],[2,2,2,1],[1,1,1,3]]");
         String expected = "";
-        Assertions.assertEquals(expected, solution6363.findTheString(lcp));
+        Assertions.assertEquals(expected, solution2573.findTheString(lcp));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6359 {`
	`1`	`+public class Solution2566 {`
`2`	`2`	`public int minMaxDifference(int num) {`
`3`	`3`	`int min = Integer.MAX_VALUE;`
`4`	`4`	`int max = 0;`
`@@ -15,7 +15,7 @@ public int minMaxDifference(int num) {`
`15`	`15`	`}`
`16`	`16`	`}`
`17`	`17`	`/*`
`18`		`-6359. 替换一个数字后的最大差值`
	`18`	`+2566. 替换一个数字后的最大差值`
`19`	`19`	`https://leetcode.cn/problems/maximum-difference-by-remapping-a-digit/`
`20`	`20`
`21`	`21`	`第 98 场双周赛 T1。`
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 Solution6361 {`
	`3`	`+public class Solution2567 {`
`4`	`4`	`public int minimizeSum(int[] nums) {`
`5`	`5`	`int n = nums.length;`
`6`	`6`	`Arrays.sort(nums);`
`@@ -12,7 +12,7 @@ public int minimizeSum(int[] nums) {`
`12`	`12`	`}`
`13`	`13`	`}`
`14`	`14`	`/*`
`15`		`-6361. 修改两个元素的最小分数`
	`15`	`+2567. 修改两个元素的最小分数`
`16`	`16`	`https://leetcode.cn/problems/minimum-score-by-changing-two-elements/`
`17`	`17`
`18`	`18`	`第 98 场双周赛 T2。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6364 {`
	`1`	`+public class Solution2572 {`
`2`	`2`	`private static final int[] PRIMES = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};`
`3`	`3`	`private static final int MAX_N = 30;`
`4`	`4`	`private static final int MOD = (int) (1e9 + 7);`
`@@ -55,7 +55,7 @@ public int squareFreeSubsets(int[] nums) {`
`55`	`55`	`}`
`56`	`56`	`}`
`57`	`57`	`/*`
`58`		`-6364. 无平方子集计数`
	`58`	`+2572. 无平方子集计数`
`59`	`59`	`https://leetcode.cn/problems/count-the-number-of-square-free-subsets/`
`60`	`60`
`61`	`61`	`第 333 场周赛 T3。`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-public class Solution6363 {`
	`1`	`+public class Solution2573 {`
`2`	`2`	`public String findTheString(int[][] lcp) {`
`3`	`3`	`int n = lcp.length;`
`4`	`4`	`char[] chars = new char[n];`
`@@ -42,7 +42,7 @@ public String findTheString(int[][] lcp) {`
`42`	`42`	`}`
`43`	`43`	`}`
`44`	`44`	`/*`
`45`		`-6363. 找出对应 LCP 矩阵的字符串`
	`45`	`+2573. 找出对应 LCP 矩阵的字符串`
`46`	`46`	`https://leetcode.cn/problems/find-the-string-with-lcp/`
`47`	`47`
`48`	`48`	`第 333 场周赛 T4。`