【leetcode】-1011. 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.

Example 1:

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.

Example 2:

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
Example 3:

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

二分法

这题最直观的解法是从最小可运重量到最大可运重量进行遍历，找到可满足天数的这个条件就是运货容量，与875. Koko Eating Bananas 可可吃香蕉问题类似，也可用二分法进行改进。

python代码

class Solution(object):
    def shipWithinDays(self, weights, D):
        """
        :type weights: List[int]
        :type D: int
        :rtype: int
        """
        l = max(weights)
        r = sum(weights)+1
        while l<r:
            mid = l + (r-l)/2
            if self.canShip(weights,D,mid):
                r = mid
            else:
                l= mid+1
        return l
    
    def canShip(self,weights,D,cap):
        d = 1
        ssum = 0
        for w in weights:
            ssum += w
            if ssum>cap:
                d += 1
                ssum = w
                if d>D:
                    return False
        return True

本来使用下面的canShip函数一直没有通过，后面调试找出问题了，原来是temp = temp- weights[i]结果小于0时也让i+1了，要对其进行判断，小于0时i应该是不变的，所以+1之后要 -1还原。

class Solution(object):
    def shipWithinDays(self, weights, D):
        """
        :type weights: List[int]
        :type D: int
        :rtype: int
        """
        l = max(weights)
        r = sum(weights)+1
        while l<r:
            mid = l + (r-l)/2
            if self.canShip(weights,D,mid):
                r = mid
            else:
                l= mid+1
        return l
    
    def canShip(self,weights,D,cap):
        i = 0
        for d in range(D):
            temp = cap
            while temp>=0:
                temp = temp- weights[i]
                i += 1
                if temp < 0:
                    i -= 1
                if i == len(weights):
                    return True
        return False