Commit58d3ce5

authored

Update Solution.java

1 parent76a5626 commit58d3ce5Copy full SHA for 58d3ce5

File tree

-5

lines changed

src/main/java/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum
- Solution.java

-5

lines changed

Lines changed: 0 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,6 @@ public long maxOutput(int n, int[][] edges, int[] price) {`
`15`	`15`	`if (n ==1) {`
`16`	`16`	`return0;`
`17`	`17`	`}`
`18`		`-`
`19`	`18`	`this.price =price;`
`20`	`19`	`tree =newArrayList[n];`
`21`	`20`	`for (inti =0;i <n;i++) {`
`@@ -25,11 +24,9 @@ public long maxOutput(int n, int[][] edges, int[] price) {`
`25`	`24`	`tree[e[0]].add(e[1]);`
`26`	`25`	`tree[e[1]].add(e[0]);`
`27`	`26`	`}`
`28`		`-`
`29`	`27`	`visited =newboolean[n];`
`30`	`28`	`visited[0] =true;`
`31`	`29`	`dfs(0);`
`32`		`-`
`33`	`30`	`returnres;`
`34`	`31`	`}`
`35`	`32`
`@@ -57,7 +54,6 @@ private long[] dfs(int node) {`
`57`	`54`	`}elseif (sub[0] >s0) {`
`58`	`55`	`s0 =sub[0];`
`59`	`56`	`}`
`60`		`-`
`61`	`57`	`if (sub[1] >=l1) {`
`62`	`58`	`s1 =l1;`
`63`	`59`	`l1 =sub[1];`
`@@ -66,7 +62,6 @@ private long[] dfs(int node) {`
`66`	`62`	`s1 =sub[1];`
`67`	`63`	`}`
`68`	`64`	`}`
`69`		`-`
`70`	`65`	`if (s0 ==0) {`
`71`	`66`	`// only one child. case: example 2`
`72`	`67`	`res =Math.max(res,Math.max(l0,l1 +price[node]));`

Comments

(0)