leetcode 410. Split Array Largest Sum(分割数组最大和）

Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.

Note:
If n is the length of array, assume the following constraints are satisfied:

1 ≤ n ≤ 1000
1 ≤ m ≤ min(50, n)
Examples:

Input:
nums = [7,2,5,10,8]
m = 2
Output:
18

Explanation:
There are four ways to split nums into two subarrays.
The best way is to split it into [7,2,5] and [10,8],
where the largest sum among the two subarrays is only 18.

思路：
方法一：
二维DP

    public int splitArray(int[] nums, int m) {
        if(nums == null || nums.length == 0) {
            return Integer.MAX_VALUE;
        }
        int n = nums.length;
        int[][] dp = new int[m+1][n];
        dp[1][0] = nums[0];
        int[] sums = new int[n];
        sums[0] = nums[0];
        
        for(int i = 2; i <= m; i++) {
            Arrays.fill(dp[i], Integer.MAX_VALUE);
        }
        
        //只分成一组时为数组的和，dp[i][j]表示index=0～j的部分分成i组，最小的最大和
        for(int j = 1; j < n; j++) {
            sums[j] = sums[j-1] + nums[j];
            dp[1][j] = sums[j];         
        }
        
        for(int i = 2; i <= m; i++) {
            for(int j = i - 1; j < n; j ++) {
                for(int k = 0; k < j; k++) {
                //因为取min，所以dp初始要设为MAX_VALUE
                    dp[i][j] = Math.min(dp[i][j], Math.max(dp[i-1][k], sums[j] - sums[k]));
                }
                
            }
        }
        
        return dp[m][n-1];
        
    }

方法二：Binary search
左边界：数组中的最大元素，因为它本身不能再分割
右边界：数组元素的和，即分为一组的情况
找出分割数组的和mid，元素依次相加，大于mid时换一组，当组数<m时说明每个组的和较大，应分割成更小的组，这时更新right = mid-1
组数>m时说明应把每个组的和增大，减小组数，这时更新left = mid + 1
即使组数=m也应该持续更新，直到left > right, 因为可能会找到和更小的
当组数减小到不能再减小时，left就是最后最小的和

    public int splitArray(int[] nums, int m) {
        if(nums == null || nums.length == 0) {
            return Integer.MAX_VALUE;
        }
        
        int left = 0;
        int right = 0;
        //int sumV = 0;
        //int result = Integer.MAX_VALUE;
        int groups = 1;
        
        for(int i = 0; i < nums.length; i++) {
            left = Math.max(left, nums[i]);
            right += nums[i];
        }
        
        
        //binary search
        while(left <= right) {
            int mid = left + (right - left) / 2;
            int sum = 0;
            groups = 1;
            //sumV = 0;
            for(int i = 0; i < nums.length; i++) {
                sum += nums[i];
                if(sum > mid) {
                    groups ++;
                    //sumV = Math.max(sumV, sum - nums[i]);
                    //result = Math.min(result, sumV);
                    sum = nums[i];
                }
            }
            //sumV = Math.max(sumV, sum);
            
            if(groups > m) { //每组的和应该大一点，分组才能少一点
                left = mid + 1;
            } else { //每组和小一点，分组才能多一点，groups==m时还可以试试和能不能再小点
                right = mid - 1;
                
            }
        }
        
        return left;
    }