Minimum Operations to Make Array Sum Divisible by K
You are given an integer array nums and an integer k. You can perform the following operation any number of times:
- Select an index
iand replacenums[i]withnums[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 = 5Output
4Perform 4 operations on nums[1] = 9 to make the array [3, 5, 7], whose sum is 15 and divisible by 5.
Example 2
Input
nums = [4,1,3], k = 4Output
0The sum is 8, which is already divisible by 4, so no operations are needed.
Constraints
- 1 <= nums.length <= 1000
- 1 <= nums[i] <= 1000
- 1 <= k <= 100