README_EN.md

1011. Capacity To Ship Packages Within D Days

中文文档

Description

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

 

Constraints:

• 1 <= D <= weights.length <= 5 * 104
• 1 <= weights[i] <= 500

Solutions

Binary search.

Python3

class Solution:
    def shipWithinDays(self, weights: List[int], D: int) -> int:
        def check(capacity):
            cnt, t = 1, 0
            for w in weights:
                if w > capacity:
                    return False
                if t + w <= capacity:
                    t += w
                else:
                    cnt += 1
                    t = w
            return cnt <= D

        left, right = 1, 25000000
        while left < right:
            mid = (left + right) >> 1
            if check(mid):
                right = mid
            else:
                left = mid + 1
        return left

Java

class Solution {
    public int shipWithinDays(int[] weights, int days) {
        int left = 1, right = Integer.MAX_VALUE;
        while (left < right) {
            int mid = (left + right) >> 1;
            if (canCarry(weights, days, mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }


    public boolean canCarry(int[] weights, int days, int carry) {
        int useDay = 1;
        int curCarry = 0;
        for (int weight : weights) {
            if (weight > carry) {
                return false;
            }
            if ((carry - curCarry) >= weight) {
                curCarry += weight;
            } else {
                curCarry = weight;
                useDay++;
            }
        }
        return useDay <= days;
    }
}

C++

class Solution {
public:
    int shipWithinDays(vector<int> &weights, int days) {
        int left = 1, right = 25000000;
        while (left < right)
        {
            int mid = left + right >> 1;
            if (check(weights, days, mid))
            {
                right = mid;
            }
            else
            {
                left = mid + 1;
            }
        }
        return left;
    }

    bool check(vector<int> &weights, int days, int capacity) {
        int cnt = 1, t = 0;
        for (auto w : weights)
        {
            if (w > capacity)
            {
                return false;
            }
            if (t + w <= capacity)
            {
                t += w;
            }
            else
            {
                ++cnt;
                t = w;
            }
        }
        return cnt <= days;
    }
};

Go

func shipWithinDays(weights []int, days int) int {
	left, right := 1, 25000000
	for left < right {
		mid := (left + right) >> 1
		if check(weights, days, mid) {
			right = mid
		} else {
			left = mid + 1
		}
	}
	return left
}

func check(weights []int, days, capacity int) bool {
	cnt, t := 1, 0
	for _, w := range weights {
		if w > capacity {
			return false
		}
		if t+w <= capacity {
			t += w
		} else {
			cnt++
			t = w
		}
	}
	return cnt <= days
}

...