Update Solution.java

Author: javadev

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

@@ -15,7 +15,6 @@ public long maxOutput(int n, int[][] edges, int[] price) {
         if (n == 1) {
             return 0;
         }
-
         this.price = price;
         tree = new ArrayList[n];
         for (int i = 0; i < n; i++) {
@@ -25,11 +24,9 @@ public long maxOutput(int n, int[][] edges, int[] price) {
             tree[e[0]].add(e[1]);
             tree[e[1]].add(e[0]);
         }
-
         visited = new boolean[n];
         visited[0] = true;
         dfs(0);
-
         return res;
     }
 
@@ -57,7 +54,6 @@ private long[] dfs(int node) {
             } else if (sub[0] > s0) {
                 s0 = sub[0];
             }
-
             if (sub[1] >= l1) {
                 s1 = l1;
                 l1 = sub[1];
@@ -66,7 +62,6 @@ private long[] dfs(int node) {
                 s1 = sub[1];
             }
         }
-
         if (s0 == 0) {
             // only one child. case: example 2
             res = Math.max(res, Math.max(l0, l1 + price[node]));