Fixed sonar

Author: javadev

src/main/java/g3101_3200/s3193_count_the_number_of_inversions/Solution.java

@@ -5,7 +5,7 @@
 import java.util.Arrays;
 
 public class Solution {
-    private final int mod = 1_000_000_007;
+    private static final int MOD = 1_000_000_007;
 
     public int numberOfPermutations(int n, int[][] r) {
         Arrays.sort(r, (o1, o2) -> o1[0] - o2[0]);
@@ -20,15 +20,15 @@ public int numberOfPermutations(int n, int[][] r) {
         for (int i = 1; i < m.length; i++) {
             m[i][0] = m[i - 1][0];
             for (int j = 1; j <= i; j++) {
-                m[i][j] = (m[i][j] + m[i][j - 1]) % mod;
-                m[i][j] = (m[i][j] + m[i - 1][j]) % mod;
+                m[i][j] = (m[i][j] + m[i][j - 1]) % MOD;
+                m[i][j] = (m[i][j] + m[i - 1][j]) % MOD;
             }
             for (int j = i + 1; j <= r[ri][1]; j++) {
-                m[i][j] = (m[i][j] + m[i][j - 1]) % mod;
-                m[i][j] = (m[i][j] + m[i - 1][j]) % mod;
+                m[i][j] = (m[i][j] + m[i][j - 1]) % MOD;
+                m[i][j] = (m[i][j] + m[i - 1][j]) % MOD;
                 m[i][j] = (m[i][j] - m[i - 1][j - i - 1]);
                 if (m[i][j] < 0) {
-                    m[i][j] += mod;
+                    m[i][j] += MOD;
                 }
             }
             if (r[ri][0] == i) {
@@ -38,7 +38,7 @@ public int numberOfPermutations(int n, int[][] r) {
                 }
                 Arrays.fill(m[i], 0);
                 m[i][r[ri][1]] = 1;
-                a = (a * t) % mod;
+                a = (a * t) % MOD;
                 ri++;
             }
         }

src/main/java/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements/Solution.java

@@ -9,7 +9,7 @@ public double minimumAverage(int[] nums) {
         Arrays.sort(nums);
         double m = 102.0;
         for (int i = 0, l = nums.length; i < l / 2; i++) {
-            m = Math.min(m, nums[i] + nums[l - i - 1]);
+            m = Math.min(m, nums[i] + (double) nums[l - i - 1]);
         }
         return m / 2.0;
     }

src/main/java/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.java

@@ -2,6 +2,7 @@
 
 // #Hard #Array #Matrix #Enumeration #2024_06_26_Time_10_ms_(99.66%)_Space_44.1_MB_(85.42%)
 
+@SuppressWarnings("java:S135")
 public class Solution {
     // rectangle unit count
     private int[][] ruc;