(largest)
| 22 | } |
| 23 | |
| 24 | function canSplit(largest) { |
| 25 | let splitCount = 0; |
| 26 | let currSum = 0; |
| 27 | |
| 28 | for (let i = 0; i < nums.length; i++) { |
| 29 | currSum += nums[i]; |
| 30 | if (currSum > largest) { |
| 31 | currSum = nums[i]; |
| 32 | splitCount++; |
| 33 | } |
| 34 | } |
| 35 | |
| 36 | return splitCount + 1 <= k; |
| 37 | } |
| 38 | |
| 39 | return result; |
| 40 | }; |
no outgoing calls
no test coverage detected