小张刷题计划

/*
 * 题目思路：
 * 1. 使用stream来计算左右边界。
 * 2. 其他部分与普通Java解法类似，只是运用了stream。
 */
import java.util.Arrays;

public class LeetCodeSolutionStream {
    public int minTime(int[] time, int m) {
        int left = Arrays.stream(time).max().getAsInt();
        int right = Arrays.stream(time).sum();
        while (left < right) {
            int mid = (left + right) / 2;
            if (canFinish(time, m, mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }

    private boolean canFinish(int[] time, int m, int maxTime) {
        int days = 1, totalTime = 0;
        for (int t : time) {
            if (totalTime + t > maxTime) {
                days++;
                totalTime = t;
                if (days > m) return false;
            } else {
                totalTime += t;
            }
        }
        return true;
    }
}