Capacity To Ship Packages Within D Days

lcpy gen -n 1011   # by problem number
lcpy gen -s capacity_to_ship_packages_within_d_days   # by problem name

Input: weights = [1,2,3,4,5,6,7,8,9,10], days = 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

Input: weights = [3,2,2,4,1,4], days = 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

Input: weights = [1,2,3,1,1], days = 4
Output: 3

class Solution:
    # Time: O(n log(sum(weights)))
    # Space: O(1)
    def ship_within_days(self, weights: list[int], days: int) -> int:
        def can_ship(capacity: int) -> bool:
            needed_days = 1
            current_load = 0
            for weight in weights:
                if current_load + weight > capacity:
                    needed_days += 1
                    current_load = 0
                current_load += weight
            return needed_days <= days

        left = max(weights)
        right = sum(weights)
        while left < right:
            mid = (left + right) // 2
            if can_ship(mid):
                right = mid
            else:
                left = mid + 1
        return left