git rename

Author: gdut-yy

leetcode-26/src/main/java/Solution6312.java renamed to leetcode-26/src/main/java/Solution2578.java

@@ -2,7 +2,7 @@
 import java.util.List;
 import java.util.PriorityQueue;
 
-public class Solution6312 {
+public class Solution2578 {
     public int splitNum(int num) {
         PriorityQueue<Integer> minHeap = new PriorityQueue<>();
         while (num > 0) {
@@ -23,7 +23,7 @@ public int splitNum(int num) {
     }
 }
 /*
-6312. 最小和分割
+2578. 最小和分割
 https://leetcode.cn/problems/split-with-minimum-sum/
 
 第 99 场双周赛 T1。

leetcode-26/src/main/java/Solution6311.java renamed to leetcode-26/src/main/java/Solution2579.java

@@ -1,11 +1,11 @@
-public class Solution6311 {
+public class Solution2579 {
     public long coloredCells(int n) {
         long k = n * 2L - 1;
         return (k * k + 1) / 2;
     }
 }
 /*
-6311. 统计染色格子数
+2579. 统计染色格子数
 https://leetcode.cn/problems/count-total-number-of-colored-cells/
 
 第 99 场双周赛 T2。

leetcode-26/src/main/java/Solution6313.java renamed to leetcode-26/src/main/java/Solution2580.java

@@ -2,7 +2,7 @@
 import java.util.Arrays;
 import java.util.List;
 
-public class Solution6313 {
+public class Solution2580 {
     private static final int MOD = (int) (1e9 + 7);
 
     public int countWays(int[][] ranges) {
@@ -56,7 +56,7 @@ private long quickPow(long a, long b) {
     }
 }
 /*
-6313. 统计将重叠区间合并成组的方案数
+2580. 统计将重叠区间合并成组的方案数
 https://leetcode.cn/problems/count-ways-to-group-overlapping-ranges/
 
 第 99 场双周赛 T3。

leetcode-26/src/main/java/Solution6314.java renamed to leetcode-26/src/main/java/Solution2581.java

@@ -5,7 +5,7 @@
 import java.util.Map;
 import java.util.Set;
 
-public class Solution6314 {
+public class Solution2581 {
     private int k;
     private Map<Integer, List<Integer>> adj;
     private Set<Long> guessSet;
@@ -57,7 +57,7 @@ private void dfs2(int x, int fa, int cnt) {
     }
 }
 /*
-6314. 统计可能的树根数目
+2581. 统计可能的树根数目
 https://leetcode.cn/problems/count-number-of-possible-root-nodes/
 
 第 99 场双周赛 T4。

leetcode-26/src/main/java/Solution6307.java renamed to leetcode-26/src/main/java/Solution2582.java

@@ -1,7 +1,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-public class Solution6307 {
+public class Solution2582 {
     public int passThePillow(int n, int time) {
         // 构造一个周期
         List<Integer> list = new ArrayList<>();
@@ -13,7 +13,7 @@ public int passThePillow(int n, int time) {
     }
 }
 /*
-6307. 递枕头
+2582. 递枕头
 https://leetcode.cn/problems/pass-the-pillow/
 
 第 335 场周赛 T1。

leetcode-26/src/main/java/Solution6308.java renamed to leetcode-26/src/main/java/Solution2583.java

@@ -4,7 +4,7 @@
 import java.util.List;
 import java.util.Queue;
 
-public class Solution6308 {
+public class Solution2583 {
     public long kthLargestLevelSum(TreeNode root, int k) {
         List<Long> sumList = new ArrayList<>();
 
@@ -32,7 +32,7 @@ public long kthLargestLevelSum(TreeNode root, int k) {
     }
 }
 /*
-6308. 二叉树中的第 K 大层和
+2583. 二叉树中的第 K 大层和
 https://leetcode.cn/problems/kth-largest-sum-in-a-binary-tree/
 
 第 335 场周赛 T2。

leetcode-26/src/main/java/Solution6309.java renamed to leetcode-26/src/main/java/Solution2584.java

@@ -3,7 +3,7 @@
 import java.util.List;
 import java.util.Map;
 
-public class Solution6309 {
+public class Solution2584 {
     public int findValidSplit(int[] nums) {
         int n = nums.length;
         Map<Integer, int[]> map = new HashMap<>();
@@ -59,7 +59,7 @@ private static List<Integer> getFactorPrime(int num) {
     }
 }
 /*
-6309. 分割数组使乘积互质
+2584. 分割数组使乘积互质
 https://leetcode.cn/problems/split-the-array-to-make-coprime-products/
 
 第 335 场周赛 T3。

leetcode-26/src/main/java/Solution6310.java renamed to leetcode-26/src/main/java/Solution2585.java

@@ -1,4 +1,4 @@
-public class Solution6310 {
+public class Solution2585 {
     private static final int MOD = (int) (1e9 + 7);
 
     public int waysToReachTarget(int target, int[][] types) {
@@ -17,7 +17,7 @@ public int waysToReachTarget(int target, int[][] types) {
     }
 }
 /*
-6310. 获得分数的方法数
+2585. 获得分数的方法数
 https://leetcode.cn/problems/number-of-ways-to-earn-points/
 
 第 335 场周赛 T4。

leetcode-26/src/test/java/Solution6312Tests.java renamed to leetcode-26/src/test/java/Solution2578Tests.java

@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6312Tests {
-    private final Solution6312 solution6312 = new Solution6312();
+public class Solution2578Tests {
+    private final Solution2578 solution2578 = new Solution2578();
 
     @Test
     public void example1() {
         int num = 4325;
         int expected = 59;
-        Assertions.assertEquals(expected, solution6312.splitNum(num));
+        Assertions.assertEquals(expected, solution2578.splitNum(num));
     }
 
     @Test
     public void example2() {
         int num = 687;
         int expected = 75;
-        Assertions.assertEquals(expected, solution6312.splitNum(num));
+        Assertions.assertEquals(expected, solution2578.splitNum(num));
     }
 }

leetcode-26/src/test/java/Solution6311Tests.java renamed to leetcode-26/src/test/java/Solution2579Tests.java

@@ -1,20 +1,20 @@
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 
-public class Solution6311Tests {
-    private final Solution6311 solution6311 = new Solution6311();
+public class Solution2579Tests {
+    private final Solution2579 solution2579 = new Solution2579();
 
     @Test
     public void example1() {
         int n = 1;
         long expected = 1;
-        Assertions.assertEquals(expected, solution6311.coloredCells(n));
+        Assertions.assertEquals(expected, solution2579.coloredCells(n));
     }
 
     @Test
     public void example2() {
         int n = 2;
         long expected = 5;
-        Assertions.assertEquals(expected, solution6311.coloredCells(n));
+        Assertions.assertEquals(expected, solution2579.coloredCells(n));
     }
 }