逐步求和得到正数的最小值

/*
 * Problem statement: Similar to the above, but using Java Stream API.
 * We will use IntStream to handle the array elements.
 */
import java.util.stream.IntStream;

public class Solution {
    public int minStartValue(int[] nums) {
        // Calculate the minimum required sum using stream operations
        int minSum = IntStream.of(nums).reduce(0, (sum, num) -> {
            sum += num;
            return Math.min(sum, 0); // Keep track of the lowest sum encountered
        });
        return 1 - minSum; // Return the startValue ensuring sum is always >= 1
    }
}