Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph/Solution.java

@@ -8,10 +8,9 @@
 import java.util.List;
 import java.util.Queue;
 
-@SuppressWarnings("unchecked")
+@SuppressWarnings({"unchecked", "unused", "java:S1172"})
 public class Solution {
     public int minMaxWeight(int n, int[][] edges, int threshold) {
-        List<int[]>[] graph = new ArrayList[n];
         List<int[]>[] reversedG = new ArrayList[n];
         for (int i = 0; i < n; i++) {
             reversedG[i] = new ArrayList<>();
@@ -25,7 +24,7 @@ public int minMaxWeight(int n, int[][] edges, int threshold) {
         int[] distance = new int[n];
         Arrays.fill(distance, Integer.MAX_VALUE);
         distance[0] = 0;
-        if (reversedG[0].size() == 0) {
+        if (reversedG[0].size().isEmpty()) {
             return -1;
         }
         Queue<Integer> que = new LinkedList<>();

src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations/Solution.java

@@ -15,7 +15,8 @@ public long countNonDecreasingSubarrays(int[] nums, long k) {
         }
         long res = 0;
         Deque<Integer> q = new ArrayDeque<>();
-        for (int j = 0, i = 0; j < nums.length; ++j) {
+        int i = 0;
+        for (int j = 0; j < nums.length; ++j) {
             while (!q.isEmpty() && nums[q.peekLast()] < nums[j]) {
                 int r = q.pollLast();
                 int l = q.isEmpty() ? i - 1 : q.peekLast();