Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 5d31868

Browse files
committed
clean code
1 parent 893268c commit 5d31868

File tree

7 files changed

+116
-1
lines changed

7 files changed

+116
-1
lines changed

‎leetcode/leetcode-35/src/main/java/Solution3425.java

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -78,5 +78,7 @@ private void dfs(int x, int fa, int topDepth) {
7878
7979
树上滑窗。
8080
时间复杂度 O(n)。
81+
相似题目: 3486. 最长特殊路径 II
82+
https://leetcode.cn/problems/longest-special-path-ii/description/
8183
rating 2715 (clist.by)
8284
*/

‎leetcode/leetcode-35/src/main/java/Solution3480.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -57,5 +57,5 @@ public long maxSubarrays(int n, int[][] conflictingPairs) {
5757
b 的最小值,记作 b0。有 [i,b0-1] 所以有 b0-i.
5858
删除一个冲突对时,b 的次小值,记作 b1,额外增加 b1-b0.
5959
时间复杂度 O(n)。
60-
rating 2647 (clist.by)
60+
rating 2760 (clist.by)
6161
*/

‎leetcode/leetcode-35/src/main/java/Solution3490.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -73,4 +73,5 @@ private int f(int i, int remain, int digitSum, boolean isLimit, boolean isNum) {
7373
时间复杂度 O(10^2 * 81 * 81) = O(656100)
7474
相似题目: 2827. 范围中美丽整数的数目
7575
https://leetcode.cn/problems/number-of-beautiful-integers-in-the-range/
76+
rating 2516 (clist.by)
7677
*/
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
import org.junit.jupiter.api.Assertions;
2+
import org.junit.jupiter.api.Test;
3+
4+
public class Solution3487Tests {
5+
private final Solution3487 solution3487 = new Solution3487();
6+
7+
@Test
8+
public void example1() {
9+
int[] nums = {1, 2, 3, 4, 5};
10+
int expected = 15;
11+
Assertions.assertEquals(expected, solution3487.maxSum(nums));
12+
}
13+
14+
@Test
15+
public void example2() {
16+
int[] nums = {1, 1, 0, 1, 1};
17+
int expected = 1;
18+
Assertions.assertEquals(expected, solution3487.maxSum(nums));
19+
}
20+
21+
@Test
22+
public void example3() {
23+
int[] nums = {1, 2, -1, -2, 1, 0, -1};
24+
int expected = 3;
25+
Assertions.assertEquals(expected, solution3487.maxSum(nums));
26+
}
27+
}
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
import org.junit.jupiter.api.Assertions;
2+
import org.junit.jupiter.api.Test;
3+
4+
import java.util.Arrays;
5+
import java.util.List;
6+
7+
public class Solution3488Tests {
8+
private final Solution3488 solution3488 = new Solution3488();
9+
10+
@Test
11+
public void example1() {
12+
int[] nums = {1, 3, 1, 4, 1, 3, 2};
13+
int[] queries = {0, 3, 5};
14+
List<Integer> expected = Arrays.asList(2, -1, 3);
15+
Assertions.assertEquals(expected, solution3488.solveQueries(nums, queries));
16+
}
17+
18+
@Test
19+
public void example2() {
20+
int[] nums = {1, 2, 3, 4};
21+
int[] queries = {0, 1, 2, 3};
22+
List<Integer> expected = Arrays.asList(-1, -1, -1, -1);
23+
Assertions.assertEquals(expected, solution3488.solveQueries(nums, queries));
24+
}
25+
}
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
import org.junit.jupiter.api.Assertions;
2+
import org.junit.jupiter.api.Test;
3+
4+
public class Solution3489Tests {
5+
private final Solution3489 solution3489 = new Solution3489();
6+
7+
@Test
8+
public void example1() {
9+
int[] nums = {2, 0, 2};
10+
int[][] queries = UtUtils.stringToInts2("[[0,2,1],[0,2,1],[1,1,3]]");
11+
int expected = 2;
12+
Assertions.assertEquals(expected, solution3489.minZeroArray(nums, queries));
13+
}
14+
15+
@Test
16+
public void example2() {
17+
int[] nums = {4, 3, 2, 1};
18+
int[][] queries = UtUtils.stringToInts2("[[1,3,2],[0,2,1]]");
19+
int expected = -1;
20+
Assertions.assertEquals(expected, solution3489.minZeroArray(nums, queries));
21+
}
22+
23+
@Test
24+
public void example3() {
25+
int[] nums = {1, 2, 3, 2, 1};
26+
int[][] queries = UtUtils.stringToInts2("[[0,1,1],[1,2,1],[2,3,2],[3,4,1],[4,4,1]]");
27+
int expected = 4;
28+
Assertions.assertEquals(expected, solution3489.minZeroArray(nums, queries));
29+
}
30+
31+
@Test
32+
public void example4() {
33+
int[] nums = {1, 2, 3, 2, 6};
34+
int[][] queries = UtUtils.stringToInts2("[[0,1,1],[0,2,1],[1,4,2],[4,4,4],[3,4,1],[4,4,5]]");
35+
int expected = 4;
36+
Assertions.assertEquals(expected, solution3489.minZeroArray(nums, queries));
37+
}
38+
}
Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
import org.junit.jupiter.api.Assertions;
2+
import org.junit.jupiter.api.Test;
3+
4+
public class Solution3490Tests {
5+
private final Solution3490 solution3490 = new Solution3490();
6+
7+
@Test
8+
public void example1() {
9+
int l = 10;
10+
int r = 20;
11+
int expected = 2;
12+
Assertions.assertEquals(expected, solution3490.beautifulNumbers(l, r));
13+
}
14+
15+
@Test
16+
public void example2() {
17+
int l = 1;
18+
int r = 15;
19+
int expected = 10;
20+
Assertions.assertEquals(expected, solution3490.beautifulNumbers(l, r));
21+
}
22+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /