给定一个整数数组和一个整数 k,找出 k 个不重叠子数组使得它们的和最大。每个子数组的数字在数组中的位置应该是连续的。
返回最大的和。
注意事项
子数组最少包含一个数
样例
给出数组 [-1,4,-2,3,-2,3] 以及 k = 2,返回 8
public class Solution {
/**
* @param nums: A list of integers
* @param k: An integer denote to find k non-overlapping subarrays
* @return: An integer denote the sum of max k non-overlapping subarrays
*/
public int maxSubArray(int[] nums, int k) {
if (nums == null || nums.length < k) return 0;
int len = nums.length;
int[][] global = new int[k+1][len+1];
int[][] local = new int[k+1][len+1];
for (int i = 1; i <= k; i++) {
local[i][i-1] = Integer.MIN_VALUE;
for (int j = i; j <= len; j++) {
local[i][j] = Math.max(local[i][j-1], global[i-1][j-1]) + nums[j-1];
if (j == i) global[i][j] = local[i][j];
else global[i][j] = Math.max(global[i][j-1], local[i][j]);
}
}
return global[k][len];
}
}