Fixed sonar

Author: javadev

src/main/java/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes/Solution.java

@@ -23,19 +23,17 @@ public int[] minimumTime(int n, int[][] edges, int[] disappear) {
                 cost = edge[2];
                 if (dist[src] != -1
                         && dist[src] != Integer.MAX_VALUE
-                        && dist[src] < disappear[src]) {
-                    if (dist[src] + cost < dist[dest]) {
-                        exit = false;
-                        dist[dest] = dist[src] + cost;
-                    }
+                        && dist[src] < disappear[src]
+                        && dist[src] + cost < dist[dest]) {
+                    exit = false;
+                    dist[dest] = dist[src] + cost;
                 }
                 if (dist[dest] != -1
                         && dist[dest] != Integer.MAX_VALUE
-                        && dist[dest] < disappear[dest]) {
-                    if (dist[dest] + cost < dist[src]) {
-                        exit = false;
-                        dist[src] = dist[dest] + cost;
-                    }
+                        && dist[dest] < disappear[dest]
+                        && dist[dest] + cost < dist[src]) {
+                    exit = false;
+                    dist[src] = dist[dest] + cost;
                 }
             }
         }

src/main/java/g3101_3200/s3116_kth_smallest_amount_with_single_denomination_combination/Solution.java

@@ -5,6 +5,7 @@
 
 import java.util.Arrays;
 
+@SuppressWarnings("java:S1119")
 public class Solution {
     public long findKthSmallest(int[] coins, int k) {
         int minC = Integer.MAX_VALUE;

src/main/java/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions/Solution.java

@@ -36,7 +36,7 @@ public int minimumOperations(int[][] grid) {
             first = second = Integer.MAX_VALUE;
             firstId = secondId = -1;
             for (int i = 0; i < 10; ++i) {
-                int tmp = Integer.MAX_VALUE;
+                int tmp;
                 int fix = n - cnt[j][i];
                 if (i == lastFirstId) {
                     tmp = fix + dp[j - 1][lastSecondId];

src/main/java/g3101_3200/s3123_find_edges_in_shortest_paths/Solution.java

@@ -30,10 +30,10 @@ public boolean[] findAnswer(int n, int[][] edges) {
             head[i] = -1;
         }
         index = 0;
-        for (int[] edge : edges) {
-            int u = edge[0];
-            int v = edge[1];
-            int w = edge[2];
+        for (int[] localEdge : edges) {
+            int u = localEdge[0];
+            int v = localEdge[1];
+            int w = localEdge[2];
             add(u, v, w);
             add(v, u, w);
         }