3817. Maximum Containers On A Ship¶

LeetCode Problem View on GitHub

3817. Maximum Containers on a Ship

Easy

You are given a positive integer n representing an n x n cargo deck on a ship. Each cell on the deck can hold one container with a weight of exactly w.

However, the total weight of all containers, if loaded onto the deck, must not exceed the ship's maximum weight capacity, maxWeight.

Return the maximum number of containers that can be loaded onto the ship.

Example 1:

Example 2:

Constraints:

• 1 <= n <= 1000
• 1 <= w <= 1000
• 1 <= maxWeight <= 109

Solution¶

class Solution {
    public int maxContainers(int n, int w, int maxWeight) {
        long weight = 0;
        int count = 0;
        for (int i = 0; i < n * n; i++) {
            weight += w;
            if (weight > maxWeight) break;
            count++;
        }
        return count;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Approach¶

Detailed explanation of the approach will be added here