JAVA_LeetCode 3512_Minimum Operations to Make Array Sum Divisible by K

JAVA_LeetCode 3512_Minimum Operations to Make Array Sum Divisible by K 풀이 class Solution { public int minOperations(int[] nums, int k) { // 요소를 모두 더한값이 k로 나눌때 나머지를 반환한다. int sum = 0; for(int num : nums) sum += num; return sum % k; } } * 출처 https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k...