Commit d67ed43

authored

Improved task 3201

1 parent 76a46a6 commit d67ed43Copy full SHA for d67ed43

File tree

-3

lines changed

src/main/java/g3201_3300
- s3201_find_the_maximum_length_of_valid_subsequence_i
  - Solution.java
- s3203_find_minimum_diameter_after_merging_two_trees
  - Solution.java

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`// #Medium #Array #Dynamic_Programming #2024_07_04_Time_5_ms_(82.23%)_Space_61.7_MB_(91.46%)`
`4`	`4`
`5`		`-class Solution {`
	`5`	`+publicclass Solution {`
`6`	`6`	`public int maximumLength(int[] nums) {`
`7`	`7`	`int n = nums.length;`
`8`	`8`	`int alter = 1;`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ public int minimumDiameterAfterMerge(int[][] edges1, int[][] edges2) {`
`18`	`18`	`return ans;`
`19`	`19`	`}`
`20`	`20`
`21`		`- publicstatic int[] diameter(int[][] g) {`
	`21`	`+ private int[] diameter(int[][] g) {`
`22`	`22`	`int n = g.length;`
`23`	`23`	`int f0;`
`24`	`24`	`int f1;`
`@@ -58,7 +58,7 @@ public static int[] diameter(int[][] g) {`
`58`	`58`	`return new int[] {d01, f0, f1};`
`59`	`59`	`}`
`60`	`60`
`61`		`- publicstatic int[][] packU(int n, int[][] ft) {`
	`61`	`+ private int[][] packU(int n, int[][] ft) {`
`62`	`62`	`int[][] g = new int[n][];`
`63`	`63`	`int[] p = new int[n];`
`64`	`64`	`for (int[] u : ft) {`

Comments

(0)