Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.java

@@ -11,25 +11,27 @@ public long maximumCoins(int[][] coins, int k) {
         int n = coins.length;
         long res = 0;
         long cur = 0;
-        for (int i = 0, j = 0; i < n; ++i) {
-            while (j < n && coins[j][1] <= coins[i][0] + k - 1) {
+        int j = 0;
+        for (int[] ints : coins) {
+            while (j < n && coins[j][1] <= ints[0] + k - 1) {
                 cur += (long) (coins[j][1] - coins[j][0] + 1) * coins[j][2];
                 j++;
             }
             if (j < n) {
-                long part = (long) Math.max(0, coins[i][0] + k - 1 - coins[j][0] + 1) * coins[j][2];
+                long part = (long) Math.max(0, ints[0] + k - 1 - coins[j][0] + 1) * coins[j][2];
                 res = Math.max(res, cur + part);
             }
-            cur -= (long) (coins[i][1] - coins[i][0] + 1) * coins[i][2];
+            cur -= (long) (ints[1] - ints[0] + 1) * ints[2];
         }
         cur = 0;
-        for (int i = 0, j = 0; i < n; ++i) {
-            cur += (long) (coins[i][1] - coins[i][0] + 1) * coins[i][2];
-            while (coins[j][1] < coins[i][1] - k + 1) {
+        j = 0;
+        for (int[] coin : coins) {
+            cur += (long) (coin[1] - coin[0] + 1) * coin[2];
+            while (coins[j][1] < coin[1] - k + 1) {
                 cur -= (long) (coins[j][1] - coins[j][0] + 1) * coins[j][2];
                 j++;
             }
-            long part = (long) Math.max(0, coins[i][1] - k - coins[j][0] + 1) * coins[j][2];
+            long part = (long) Math.max(0, coin[1] - k - coins[j][0] + 1) * coins[j][2];
             res = Math.max(res, cur - part);
         }
         return res;

src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals/Solution.java

@@ -7,6 +7,7 @@
 import java.util.Comparator;
 import java.util.List;
 
+@SuppressWarnings("java:S6541")
 public class Solution {
     public int[] maximumWeight(List<List<Integer>> intervals) {
         int n = intervals.size();
@@ -57,7 +58,6 @@ class S {
                     }
                     return Integer.compare(a.x.length, b.x.length);
                 };
-
         for (int i = 0; i < n; i++) {
             dp[i][0] = base;
             for (int k = 1; k <= 4; k++) {
@@ -76,9 +76,8 @@ class S {
         S ans = base;
         for (int k = 1; k <= 4; k++) {
             S candidate = dp[n - 1][k];
-            if (ans.sum < candidate.sum) {
-                ans = candidate;
-            } else if (ans.sum == candidate.sum && cmp.compare(ans, candidate) > 0) {
+            if (ans.sum < candidate.sum
+                    || ans.sum == candidate.sum && cmp.compare(ans, candidate) > 0) {
                 ans = candidate;
             }
         }