题意:
有一艘货轮在D天内往返于A B港口运送货物,货物重量的序列为weights
(不可改变顺序),求一个最小的货轮载重能力,使得货轮能够在D天内运送完所有货物。
思路:
第一反应是二分答案,因为载重能力越强,所需时间越少。考虑是否能O(n)
检查答案。对于货物x,假如可以在当天装上货轮,那么留到第二天装上货轮一定不比当天装货优,因此直接扫描序列,每一天尽可能装更多的货物,检查D天内是否能装完。复杂度O(nlog(n*weight))
class Solution:
def shipWithinDays(self, weights: List[int], D: int) -> int:
lenn = len(weights)
def check(load):
ind = 0
cnt = D
while ind < lenn and cnt:
sm = 0
while ind < lenn and sm + weights[ind] <= load:
sm += weights[ind]
ind += 1
cnt -= 1
if ind >= lenn: return True
elif cnt == 0: return False
def find(L, R):
while L < R:
mid = (L + R) >> 1
if check(mid):
R = mid
else: L = mid + 1
return L
return find(1, sum(weights))