袋子里最少数目的球

/*
题目思路：
1. 使用Java Stream处理数组。
2. 使用二分查找找到最小的可能最大值。
*/

import java.util.Arrays;

public class Solution {
    public int minimumSize(int[] nums, int maxOperations) {
        int left = 1, right = Arrays.stream(nums).max().getAsInt();
        while (left < right) {
            int mid = (left + right) / 2;
            if (canDivide(nums, maxOperations, mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }

    private boolean canDivide(int[] nums, int maxOperations, int maxSize) {
        int operations = Arrays.stream(nums).map(num -> (num - 1) / maxSize).sum();
        return operations <= maxOperations;
    }
}