S3512

Author: trinhminhtriet

solutions/3500-3599/3512.minimum-operations-to-make-array-sum-divisible-by-k/Solution.java

@@ -2,26 +2,7 @@
 
 class Solution {
     public int minOperations(int[] nums, int k) {
-        int sum = 0;
-        for (int num : nums) {
-            sum += num;
-        }
-
-        int mod = sum % k;
-        if (mod == 0)
-            return 0;
-
-        Arrays.sort(nums);
-        int operations = 0;
-        int reduction = 0;
-        for (int i = nums.length - 1; i >= 0; i--) {
-            int maxReduce = Math.min(nums[i], mod - reduction);
-            operations += maxReduce;
-            reduction += maxReduce;
-            if (reduction >= mod)
-                break;
-        }
-
-        return operations;
+        int sum = Arrays.stream(nums).sum();
+        return sum % k;
     }
 }