forked from algorithm009-class01/algorithm009-class01
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSplitArray.java
More file actions
30 lines (28 loc) · 898 Bytes
/
SplitArray.java
File metadata and controls
30 lines (28 loc) · 898 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
package dynamic;
public class SplitArray {
public int spiltArray(int[] nums,int m){
if (nums == null) return -1;
int[][] dp = new int[m][nums.length];
dp[0][0] = nums[0];
for (int i=1;i<nums.length;i++){
dp[0][i] = nums[i]+dp[0][i-1];
}
for (int i = 1; i < m; i++) {
for (int j =i;j<nums.length;j++){
int min = Integer.MAX_VALUE;
for (int k =0;k<j;k++){
min = Math.min(min,Math.max(dp[i-1][k],dp[0][j]-dp[0][k]));
}
dp[i][j] = min;
}
}
return dp[m-1][nums.length-1];
}
public static void main(String[] args) {
int[] nums = {7,2,5,10,8};
int m = 2;
SplitArray splitArray = new SplitArray();
int r = splitArray.spiltArray(nums,m);
System.out.println(r);
}
}