最小化数组中的最大值

/*
 * Problem Approach:
 * We are given an array of non-negative integers. We need to find the minimum possible value of the maximum number in the array after performing certain operations. The operations allowed are: decrease any nums[i] (where 1 <= i < n) by 1 and increase nums[i-1] by 1. 
 * The idea is to use binary search to find the minimum possible value of the maximum element.
 * For each mid value, check if it's possible to reduce the array such that the maximum element is less than or equal to mid using a helper function.
 */
import java.util.Arrays;

public class Solution {
    public int minimizeArrayValue(int[] nums) {
        int left = Arrays.stream(nums).min().orElse(0);
        int right = Arrays.stream(nums).max().orElse(0);
        while (left < right) {
            int mid = (left + right) / 2;
            if (canReduce(nums, mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }

    private boolean canReduce(int[] nums, int max) {
        long sum = 0;
        for (int num : nums) {
            sum += num;
            if (sum > (long) max * (nums.length - 1)) {
                return false;
            }
        }
        return true;
    }
}