Movatterモバイル変換


[0]ホーム

URL:


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

Commitd67ed43

Browse files
authored
Improved task 3201
1 parent76a46a6 commitd67ed43

File tree

2 files changed

+3
-3
lines changed
  • src/main/java/g3201_3300

2 files changed

+3
-3
lines changed

‎src/main/java/g3201_3300/s3201_find_the_maximum_length_of_valid_subsequence_i/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Array #Dynamic_Programming #2024_07_04_Time_5_ms_(82.23%)_Space_61.7_MB_(91.46%)
44

5-
classSolution {
5+
publicclassSolution {
66
publicintmaximumLength(int[]nums) {
77
intn =nums.length;
88
intalter =1;

‎src/main/java/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ public int minimumDiameterAfterMerge(int[][] edges1, int[][] edges2) {
1818
returnans;
1919
}
2020

21-
publicstaticint[]diameter(int[][]g) {
21+
privateint[]diameter(int[][]g) {
2222
intn =g.length;
2323
intf0;
2424
intf1;
@@ -58,7 +58,7 @@ public static int[] diameter(int[][] g) {
5858
returnnewint[] {d01,f0,f1};
5959
}
6060

61-
publicstaticint[][]packU(intn,int[][]ft) {
61+
privateint[][]packU(intn,int[][]ft) {
6262
int[][]g =newint[n][];
6363
int[]p =newint[n];
6464
for (int[]u :ft) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp