0最大最小问题中等 LeetCode1011. 在 D 天内送达包裹的能力

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

    public boolean transport(int[] weights, int k, int days) {
        int times = 1;
        int weight = 0;
        for (int i = 0; i < weights.length; i++) {
            weight += weights[i];
            if (weight > k) {
                times++;
                weight = weights[i];
            }
        }
        return times <= days;
    }
}