1011. Capacity To Ship Packages Within D Days

ujn20161222

于 2024-09-04 11:32:21 发布

阅读量180

点赞数 2

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/141889008

版权

https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/description/?envType=company&envId=tiktok&favoriteSlug=tiktok-three-months

class Solution:
    def shipWithinDays(self, weights: List[int], days: int) -> int:
        n=len(weights)
        r=sum(weights)
        l=max(weights)

        @cache
        def check(capacity):
            i=0
            d=0
            while i<n:
                d+=1
                tank=capacity
                while i<n and tank>=weights[i]:
                    tank-=weights[i]
                    i+=1
            return d
            
        while 1:
            m=(l+r)//2
            if check(m)==days and check(m-1)<days:
                return m
            elif check(m)<=days:
                r=m
            elif check(m)>days:
                l=m
            if r-l<=1:
                if check(l)<=days:
                    return l
                return r

注意最小的left