Leetcode 1014. Capacity To Ship Packages Within D Days

题目描述(传送门)

A conveyor belt has packages that must be shipped from one port to another within D days.
The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.
Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within D days.

Examples :

Input: weights = [1,2,3,4,5,6,7,8,9,10], D = 5
Output: 15
Explanation:
A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:
1st day: 1, 2, 3, 4, 5
2nd day: 6, 7
3rd day: 8
4th day: 9
5th day: 10
Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.

Input: weights = [3,2,2,4,1,4], D = 3
Output: 6
Explanation:
A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:
1st day: 3, 2
2nd day: 2, 4
3rd day: 1, 4

Input: weights = [1,2,3,1,1], D = 4
Output: 3
Explanation:
1st day: 1
2nd day: 2
3rd day: 3
4th day: 1, 1

Note :

1 <= D <= weights.length <= 50000
1 <= weights[i] <= 500

Code

1.思路：传送带的最大载重量，在最大单个包裹重量与连续的平均每天运送包裹个数的包裹之和的最大值。可能有点绕，直接计算结果吧。最小值：遍历所有包裹，最大重量就是最小值；最大值：首先所有包裹个数除以天数，得到平均每天需要运送多少个包裹记为unit，然后遍历所有包裹，连续unit个包裹之和的最大值就是最大值了。然后从最大值开始，逐步计算小一点的载重量是不是满足要求，如果满足，则计算再小一点的载重量；如果不满足了，则当先载重量就是最小满足要求的载重量了。总的来说，当前载重量n满足要求，并且n-1不满足要求，则n就是最小载重量。

class Solution {
    public int shipWithinDays(int[] weights, int D) {
        if(weights == null || weights.length <= 0)return 0;
        //计算unit
        int unit = 0;
        if(weights.length % D == 0){
            unit = weights.length/D;
        }else{
            unit = weights.length/D+1;
        }
        //计算最大值
        int max = 0;
        int first;
        for(int i = 0; i < weights.length && i+unit-1<weights.length;i++){
            first = 0;
            for(int j = 0; j < unit;j++){
                first += weights[i+j];
            }
            if(first > max)max = first;
        }

        //计算最小值
        int maxValue = 0;
        for(int i = 0; i<weights.length;i++){
            if(weights[i] > maxValue){
                maxValue = weights[i];
            }
        }


        //check
        int temp = max -1;
        int days;
        boolean flag = true;
        int sum;
        while(flag && temp >= maxValue){
            days = 0;
            sum = 0;
            for(int i = 0; i < weights.length; i++){
                sum += weights[i];//计算一天运送的包裹总重量
                if(sum > temp){//如果加上当前包裹已经超重了
                    days++;
                    sum = weights[i];//当前包裹顺延到下一天运送
                }else if(sum == temp){//如果刚好等于最大载重量
                    days++;
                    sum = 0;//置零
                }
            }
            if(sum > 0)days++;//最后一天
            if(days > D) flag = false;
            else{
                temp--;
            }
        }
        return temp + 1;
    }
}