java LintCode 437.书籍复印

1.题目

2.解法

①二维数组+动态规划

public class Solution {
    public int copyBooks(int[] pages, int k) {
        int n = pages.length;
        if(n == 0) return 0;
        if(k > n) k = n;
        int[][] dp = new int[k+1][n+1];
        int[] sums = new int[n+1];

        Arrays.fill(sums, 0);
        for(int i = 1; i <= n; i++){
            sums[i] = sums[i - 1] + pages[i - 1];
        }
        for(int j = 0; j <= n; j++){
            dp[0][j] = Integer.MAX_VALUE;
        }
        for(int i = 0; i <= k; i++){
            dp[i][0] = 0;
        }
        for(int i = 1; i <= k; i++){
            for(int j = 1; j <= n; j++){
                dp[i][j] = Integer.MAX_VALUE;
                for(int j_ = 0; j_ < j; j_++){
                    dp[i][j] = Math.min(dp[i][j], Math.max(dp[i-1][j_], sums[j] - sums[j_]));
                }
            }
        }
        return dp[k][n];
    }
}