Fixed sonar

Author: javadev

src/main/java/g3501_3600/s3589_count_prime_gap_balanced_subarrays/Solution.java

@@ -7,6 +7,7 @@
 import java.util.List;
 import java.util.TreeMap;
 
+@SuppressWarnings("java:S5413")
 public class Solution {
     private static final int MAXN = 100005;
     private final boolean[] isPrime;

src/main/java/g3501_3600/s3593_minimum_increments_to_equalize_leaf_paths/Solution.java

@@ -21,10 +21,8 @@ public int minIncrease(int n, int[][] edges, int[] cost) {
                 }
             }
             for (int e : g[cur]) {
-                if (par[cur] != e) {
-                    if (dp[e] != max) {
-                        ret++;
-                    }
+                if (par[cur] != e && dp[e] != max) {
+                    ret++;
                 }
             }
             dp[cur] = max + cost[cur];
@@ -40,7 +38,9 @@ private int[][] parents(int[][] g) {
         depth[0] = 0;
         int[] q = new int[n];
         q[0] = 0;
-        for (int p = 0, r = 1; p < r; p++) {
+        int p = 0;
+        int r = 1;
+        while (p < r) {
             int cur = q[p];
             for (int nex : g[cur]) {
                 if (par[cur] != nex) {
@@ -49,6 +49,7 @@ private int[][] parents(int[][] g) {
                     depth[nex] = depth[cur] + 1;
                 }
             }
+            p++;
         }
         return new int[][] {par, q, depth};
     }