使数组中的所有元素都等于零

/*
 * Problem: Given an integer array 'nums' and a positive integer 'k',
 * determine if it is possible to make all elements of the array equal to 0
 * by repeatedly selecting any subarray of length 'k' and subtracting 1 from each element of that subarray.
 *
 * Approach (using Java Streams):
 * 1. Iterate through the array and reduce the first 'k' elements by the minimum value among them.
 * 2. Repeat the process for subsequent elements until the whole array is checked.
 * 3. If at any point, the remaining elements can't form a subarray of length 'k', return false.
 * 4. If all elements are reduced to zero, return true.
 */
import java.util.Arrays;
import java.util.stream.IntStream;

public class SolutionStream {
    public boolean canMakeAllZero(int[] nums, int k) {
        int n = nums.length;
        int[] sub = new int[n + 1];
        IntStream.range(0, n).forEach(i -> {
            if (i >= k) sub[i] += sub[i - k];
            nums[i] -= sub[i];
            if (nums[i] < 0) throw new IllegalStateException("Can't make all elements zero");
            if (nums[i] > 0) sub[i] += nums[i];
        });
        return IntStream.of(nums).allMatch(x -> x == 0);
    }
}