Fixed sonar

Author: javadev

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

@@ -5,8 +5,8 @@
 public class Solution {
     public int smallestAbsent(int[] nums) {
         int sum = 0;
-        for (int i = 0; i < nums.length; i++) {
-            sum += nums[i];
+        for (int j : nums) {
+            sum += j;
         }
         double avg = (double) sum / nums.length;
         int num;
@@ -17,16 +17,14 @@ public int smallestAbsent(int[] nums) {
         }
         while (true) {
             boolean flag = false;
-            for (int i = 0; i < nums.length; i++) {
-                if (num == nums[i]) {
+            for (int j : nums) {
+                if (num == j) {
                     flag = true;
                     break;
                 }
             }
-            if (!flag) {
-                if (num > avg) {
-                    return num;
-                }
+            if (!flag && num > avg) {
+                return num;
             }
             num++;
         }

src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.java

@@ -27,9 +27,7 @@ public int[] maxKDistinct(int[] nums, int k) {
             n++;
         }
         int[] finl = new int[cnt];
-        for (int i = 0; i < cnt; i++) {
-            finl[i] = arr[i];
-        }
+        System.arraycopy(arr, 0, finl, 0, cnt);
         return finl;
     }
 }