Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3364_minimum_positive_sum_subarray/Solution.java

@@ -14,10 +14,8 @@ public int minimumSumSubarray(List<Integer> nums, int l, int r) {
                 for (int j = i; j < i + s; j++) {
                     sum += nums.get(j);
                 }
-                if (sum > 0) {
-                    if (res == -1 || res > sum) {
-                        res = sum;
-                    }
+                if (sum > 0 && (res == -1 || res > sum)) {
+                    res = sum;
                 }
             }
         }

src/main/java/g3301_3400/s3366_minimum_array_sum/Solution.java

@@ -32,6 +32,7 @@ private int sub(Integer[][][] dp, int[] nums, int i, int k, int op1, int op2) {
             int v = (int) Math.ceil(nums[i] / 2.0);
             res = Math.min(res, sub(dp, nums, i + 1, k, op1 - 1, op2) + v);
         }
-        return dp[i][op1][op2] = res;
+        dp[i][op1][op2] = res;
+        return res;
     }
 }

src/main/java/g3301_3400/s3367_maximize_sum_of_weights_after_edge_removals/Solution.java

@@ -23,7 +23,8 @@ private long[] maximizeSumOfWeights(
         for (int[] i : map.get(v)) {
             if (i[0] != from) {
                 long[] next = maximizeSumOfWeights(i[0], v, k, map);
-                sum += Math.max(next[0], next[1] += i[1]);
+                next[1] += i[1];
+                sum += Math.max(next[0], next[1]);
                 if (next[0] < next[1]) {
                     queue.offer(next[1] - next[0]);
                     sum -= queue.size() > k ? queue.poll() : 0;