#297 · #410 · Split Array Largest Sum(分割数组的最大值)

Given an array nums of non-negative integers and an integer k, split the array into k non-empty contiguous subarrays so that the largest subarray sum is minimised. Return that minimum largest sum. Constraints: 1 <= nums.length <= 1000, 0 <= nums[i] <= 10^6, 1 <= k <= min(50, nums.length).