Fixed sonar

Author: javadev

Diff for: src/main/java/g3501_3600/s3507_minimum_pair_removal_to_sort_array_i/Solution.java

@@ -19,14 +19,16 @@ public int minimumPairRemoval(int[] nums) {
             // Merge the pair at index
             int[] newNums = new int[nums.length - 1];
             int j = 0;
-            for (int i = 0; i < nums.length; i++) {
+            int i = 0;
+            while (i < nums.length) {
                 if (i == index) {
                     newNums[j++] = nums[i] + nums[i + 1];
                     // Skip the next one since it's merged
                     i++;
                 } else {
                     newNums[j++] = nums[i];
                 }
+                i++;
             }
             nums = newNums;
             operations++;

Diff for: src/main/java/g3501_3600/s3508_implement_router/Router.java

@@ -7,6 +7,7 @@
 import java.util.LinkedList;
 import java.util.Queue;
 
+@SuppressWarnings("java:S135")
 public class Router {
     private final int size;
     private int cur;

Diff for: src/main/java/g3501_3600/s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k/Solution.java

@@ -6,6 +6,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
+@SuppressWarnings("java:S6541")
 public class Solution {
     static class StateKey {
         int prod;

Diff for: src/main/java/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii/Solution.java

@@ -6,6 +6,7 @@
 import java.util.Arrays;
 import java.util.List;
 
+@SuppressWarnings("java:S127")
 public class Solution {
     public int minimumPairRemoval(int[] nums) {
         int n = nums.length;
@@ -64,16 +65,16 @@ public int minimumPairRemoval(int[] nums) {
     }
 
     public static class MinHeapL {
-        public long[] hi;
-        public long[] lo;
-        public int[] map;
-        public int[] imap;
-        public int n;
-        public int pos;
-        public static final long INF = Long.MAX_VALUE;
+        static final long INF = Long.MAX_VALUE;
+
+        long[] hi;
+        long[] lo;
+        int[] map;
+        int[] imap;
+        int n;
+        int pos;
 
         public MinHeapL(int m) {
-            // ヒープ配列のサイズは内部実装に合わせて決定
             n = Integer.highestOneBit((m + 1) << 1);
             hi = new long[n];
             lo = new long[n];