Fixed sonar

Author: javadev

src/main/java/g3001_3100/s3066_minimum_operations_to_exceed_threshold_value_ii/Solution.java

@@ -13,16 +13,11 @@ public int minOperations(int[] nums, int k) {
         int steps = 0;
         Arrays.sort(nums);
         List<Integer> extra = new ArrayList<>();
-        boolean increase = true;
         int i = 0;
         int j = 0;
-        while (increase) {
-            if ((i >= n || nums[i] >= k) && (j >= extra.size() || extra.get(j) >= k)) {
-                increase = false;
-                break;
-            }
-            int min = -1;
-            int max = -1;
+        while ((i < n && nums[i] < k) || (j < extra.size() && extra.get(j) < k)) {
+            int min;
+            int max;
             if (i < n && (j >= extra.size() || extra.get(j) > nums[i])) {
                 min = nums[i++];
             } else {

src/main/java/g3001_3100/s3068_find_the_maximum_sum_of_node_values/Solution.java

@@ -3,6 +3,7 @@
 // #Hard #Array #Dynamic_Programming #Sorting #Greedy #Tree #Bit_Manipulation
 // #2024_03_31_Time_1_ms_(100.00%)_Space_54.5_MB_(67.07%)
 
+@SuppressWarnings("java:S1172")
 public class Solution {
     public long maximumValueSum(int[] nums, int k, int[][] edges) {
         long res = 0;