Skip to content

Improved task 3201 #1782

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 6, 2024
Merged

Improved task 3201 #1782

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/main/java/g3201_3300/s3201_find_the_maximum_length_of_valid_subsequence_i/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

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

class Solution {
public class Solution {
public int maximumLength(int[] nums) {
int n = nums.length;
int alter = 1;
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ public int minimumDiameterAfterMerge(int[][] edges1, int[][] edges2) {
return ans;
}

public static int[] diameter(int[][] g) {
private int[] diameter(int[][] g) {
int n = g.length;
int f0;
int f1;
Expand Down Expand Up @@ -58,7 +58,7 @@ public static int[] diameter(int[][] g) {
return new int[] {d01, f0, f1};
}

public static int[][] packU(int n, int[][] ft) {
private int[][] packU(int n, int[][] ft) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int[] u : ft) {
Expand Down
Loading