You are given an integer array nums and an integer k. You can perform the following operation any number of times:
i and replace nums[i] with nums[i] - 1.Return the minimum number of operations required to make the sum of the array divisible by k.
Example 1:
Input: nums = [3,9,7], k = 5
Output: 4
Explanation:
nums[1] = 9. Now, nums = [3, 5, 7].Example 2:
Input: nums = [4,1,3], k = 4
Output: 0
Explanation:
Example 3:
Input: nums = [3,2], k = 6
Output: 5
Explanation:
nums[0] = 3 and 2 operations on nums[1] = 2. Now, nums = [0, 0].
Constraints:
1 <= nums.length <= 10001 <= nums[i] <= 10001 <= k <= 100class Solution {
public int minOperations(int[] nums, int k) {
int sum = 0;
for(int i: nums)
sum += i;
return sum % k;
}
}