LeetCode 1011: Capacity To Ship Packages Within D Days Solution

Master LeetCode problem 1011 (Capacity To Ship Packages Within D Days), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1011. Capacity To Ship Packages Within D Days

Medium

Array Binary Search

Problem Explanation

Explanation:

To solve this problem, we can use binary search to find the minimum weight capacity of the ship that allows us to ship all packages within D days. We will define the search space as the range from the maximum weight in the weights array to the sum of all weights in the array.

For each candidate weight capacity, we simulate the loading process by iterating through the weights array and assigning packages to each day, ensuring that the weight capacity is not exceeded. If we can successfully ship all packages within D days, we move to the left half of the search space to find a smaller weight capacity, otherwise we move to the right half.

We continue this process until we find the minimum weight capacity that allows us to ship all packages within D days.

Time Complexity:

The time complexity of this approach is O(N * log(sum(weights))), where N is the number of weights and sum(weights) is the sum of all weights in the array.

Space Complexity:

The space complexity is O(1) as we are not using any extra space apart from a few variables.

Solution Code

class Solution {
    public int shipWithinDays(int[] weights, int D) {
        int left = 0, right = 0;
        for (int weight : weights) {
            left = Math.max(left, weight);
            right += weight;
        }
        
        while (left < right) {
            int mid = left + (right - left) / 2;
            int currWeight = 0, days = 1;
            for (int weight : weights) {
                if (currWeight + weight > mid) {
                    days++;
                    currWeight = 0;
                }
                currWeight += weight;
            }
            if (days > D) {
                left = mid + 1;
            } else {
                right = mid;
            }
        }
        return left;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1011 (Capacity To Ship Packages Within D Days)?

This page provides optimized solutions for LeetCode problem 1011 (Capacity To Ship Packages Within D Days) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1011 (Capacity To Ship Packages Within D Days)?

The time complexity for LeetCode 1011 (Capacity To Ship Packages Within D Days) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1011 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1011 in Java, C++, or Python.

Back to LeetCode Solutions