|
| 1 | +/** |
| 2 | + * @param {number[]} nums |
| 3 | + * @param {number} k |
| 4 | + * @return {number} |
| 5 | + */ |
| 6 | +var minArraySum = function(nums, k) { |
| 7 | + if (k === 1) return 0 |
| 8 | + const n = nums.length |
| 9 | + const total = nums.reduce((acc, num) => acc + num, 0) |
| 10 | + const bestSoFar = new Array(k).fill(-1e20) |
| 11 | + bestSoFar[0] = 0 |
| 12 | + let prefixAcc = 0 |
| 13 | + const dp = new Array(n).fill(0) |
| 14 | + |
| 15 | + for (let i = 0; i < nums.length; i++) { |
| 16 | + prefixAcc += nums[i] |
| 17 | + const r = prefixAcc % k |
| 18 | + // DELETE + NO DELETE |
| 19 | + const a = prefixAcc + bestSoFar[r] |
| 20 | + dp[i] = Math.max(dp[i - 1] || 0, a) |
| 21 | + |
| 22 | + const b = dp[i] - prefixAcc |
| 23 | + if (b > bestSoFar[r]) { |
| 24 | + bestSoFar[r] = b |
| 25 | + } |
| 26 | + } |
| 27 | + return total - dp[dp.length - 1] < 1e19 |
| 28 | + ? total - dp[dp.length - 1] |
| 29 | + : prefixAcc |
| 30 | +}; |
0 commit comments