git rename

Author: gdut-yy

leetcode-26/src/main/java/Solution6315.java renamed to leetcode-26/src/main/java/Solution2586.java

@@ -1,4 +1,4 @@
-public class Solution6315 {
+public class Solution2586 {
     public int vowelStrings(String[] words, int left, int right) {
         int res = 0;
         for (int i = left; i <= right; i++) {
@@ -17,7 +17,7 @@ private boolean isVowel(String s) {
     }
 }
 /*
-6315. 统计范围内的元音字符串数
+2586. 统计范围内的元音字符串数
 https://leetcode.cn/problems/count-the-number-of-vowel-strings-in-range/
 
 第 336 场周赛 T1。

leetcode-26/src/main/java/Solution6316.java renamed to leetcode-26/src/main/java/Solution2587.java

@@ -1,6 +1,6 @@
 import java.util.Arrays;
 
-public class Solution6316 {
+public class Solution2587 {
     public int maxScore(int[] nums) {
         int n = nums.length;
         Arrays.sort(nums);
@@ -17,7 +17,7 @@ public int maxScore(int[] nums) {
     }
 }
 /*
-6316. 重排数组以得到最大前缀分数
+2587. 重排数组以得到最大前缀分数
 https://leetcode.cn/problems/rearrange-array-to-maximize-prefix-score/
 
 第 336 场周赛 T2。

leetcode-26/src/main/java/Solution6317.java renamed to leetcode-26/src/main/java/Solution2588.java

@@ -1,4 +1,4 @@
-public class Solution6317 {
+public class Solution2588 {
     public long beautifulSubarrays(int[] nums) {
         long res = 0L;
         int sumMod2Mask = 0;
@@ -13,7 +13,7 @@ public long beautifulSubarrays(int[] nums) {
     }
 }
 /*
-6317. 统计美丽子数组数目
+2588. 统计美丽子数组数目
 https://leetcode.cn/problems/count-the-number-of-beautiful-subarrays/
 
 第 336 场周赛 T3。

leetcode-26/src/main/java/Solution6318.java renamed to leetcode-26/src/main/java/Solution2589.java

@@ -1,7 +1,7 @@
 import java.util.Arrays;
 import java.util.Comparator;
 
-public class Solution6318 {
+public class Solution2589 {
     public int findMinimumTime(int[][] tasks) {
         Arrays.sort(tasks, Comparator.comparingInt(o -> o[1]));
         boolean[] isRun = new boolean[2001];
@@ -31,7 +31,7 @@ public int findMinimumTime(int[][] tasks) {
     }
 }
 /*
-6318. 完成所有任务的最少时间
+2589. 完成所有任务的最少时间
 https://leetcode.cn/problems/minimum-time-to-complete-all-tasks/
 
 第 336 场周赛 T4。

leetcode-26/src/test/java/Solution6315Tests.java renamed to leetcode-26/src/test/java/Solution2586Tests.java

@@ -1,16 +1,16 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6315Tests {
-    private final Solution6315 solution6315 = new Solution6315();
+public class Solution2586Tests {
+    private final Solution2586 solution2586 = new Solution2586();
 
     @Test
     public void example1() {
         String[] words = {"are", "amy", "u"};
         int left = 0;
         int right = 2;
         int expected = 2;
-        Assertions.assertEquals(expected, solution6315.vowelStrings(words, left, right));
+        Assertions.assertEquals(expected, solution2586.vowelStrings(words, left, right));
     }
 
     @Test
@@ -19,6 +19,6 @@ public void example2() {
         int left = 1;
         int right = 4;
         int expected = 3;
-        Assertions.assertEquals(expected, solution6315.vowelStrings(words, left, right));
+        Assertions.assertEquals(expected, solution2586.vowelStrings(words, left, right));
     }
 }

leetcode-26/src/test/java/Solution6316Tests.java renamed to leetcode-26/src/test/java/Solution2587Tests.java

@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6316Tests {
-    private final Solution6316 solution6316 = new Solution6316();
+public class Solution2587Tests {
+    private final Solution2587 solution2587 = new Solution2587();
 
     @Test
     public void example1() {
         int[] nums = {2, -1, 0, 1, -3, 3, -3};
         int expected = 6;
-        Assertions.assertEquals(expected, solution6316.maxScore(nums));
+        Assertions.assertEquals(expected, solution2587.maxScore(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {-2, -3, 0};
         int expected = 0;
-        Assertions.assertEquals(expected, solution6316.maxScore(nums));
+        Assertions.assertEquals(expected, solution2587.maxScore(nums));
     }
 }

leetcode-26/src/test/java/Solution6317Tests.java renamed to leetcode-26/src/test/java/Solution2588Tests.java

@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6317Tests {
-    private final Solution6317 solution6317 = new Solution6317();
+public class Solution2588Tests {
+    private final Solution2588 solution2588 = new Solution2588();
 
     @Test
     public void example1() {
         int[] nums = {4, 3, 1, 2, 4};
         long expected = 2;
-        Assertions.assertEquals(expected, solution6317.beautifulSubarrays(nums));
+        Assertions.assertEquals(expected, solution2588.beautifulSubarrays(nums));
     }
 
     @Test
     public void example2() {
         int[] nums = {1, 10, 4};
         long expected = 0;
-        Assertions.assertEquals(expected, solution6317.beautifulSubarrays(nums));
+        Assertions.assertEquals(expected, solution2588.beautifulSubarrays(nums));
     }
 }

leetcode-26/src/test/java/Solution6318Tests.java renamed to leetcode-26/src/test/java/Solution2589Tests.java

@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6318Tests {
-    private final Solution6318 solution6318 = new Solution6318();
+public class Solution2589Tests {
+    private final Solution2589 solution2589 = new Solution2589();
 
     @Test
     public void example1() {
         int[][] tasks = UtUtils.stringToInts2("[[2,3,1],[4,5,1],[1,5,2]]");
         int expected = 2;
-        Assertions.assertEquals(expected, solution6318.findMinimumTime(tasks));
+        Assertions.assertEquals(expected, solution2589.findMinimumTime(tasks));
     }
 
     @Test
     public void example2() {
         int[][] tasks = UtUtils.stringToInts2("[[1,3,2],[2,5,3],[5,6,2]]");
         int expected = 4;
-        Assertions.assertEquals(expected, solution6318.findMinimumTime(tasks));
+        Assertions.assertEquals(expected, solution2589.findMinimumTime(tasks));
     }
 }