Fixed sonar

Author: javadev

src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.java

@@ -18,7 +18,14 @@ public int smallestAbsent(int[] nums) {
         int n = nums.length;
         Arrays.sort(nums);
         avg = sum / n;
-        double j = avg < 0 ? 1 : Math.ceil(avg) == avg ? avg + 1 : Math.ceil(avg);
+        double j;
+        if (avg < 0) {
+            j = 1;
+        } else if (Math.ceil(avg) == avg) {
+            j = avg + 1;
+        } else {
+            j = Math.ceil(avg);
+        }
         for (int i = (int) j; i <= 100; i++) {
             if (!set.contains(i)) {
                 return i;

src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.java

@@ -4,6 +4,7 @@
 
 import java.util.Arrays;
 
+@SuppressWarnings("java:S135")
 public class Solution {
     private static final int MAX_K = 4001;
     private final boolean[] dp = new boolean[MAX_K];