舒适的湿度

// 思路：Java Stream API 对于这种需要连续子数组和的问题并不直接支持，我们仍然需要先计算出所有的连续子数组和，然后取其最大和最小值来判断。
import java.util.stream.IntStream;

public class Solution {
    public int minUnfitness(int[] operate) {
        int[] maxSum = {Integer.MIN_VALUE};
        int[] minSum = {Integer.MAX_VALUE};
        int[] currentMax = {0};
        int[] currentMin = {0};
        IntStream.of(operate).forEach(num -> {
            currentMax[0] = Math.max(num, currentMax[0] + num);
            maxSum[0] = Math.max(maxSum[0], currentMax[0]);
            currentMin[0] = Math.min(num, currentMin[0] + num);
            minSum[0] = Math.min(minSum[0], currentMin[0]);
        });
        return Math.max(Math.abs(maxSum[0]), Math.abs(minSum[0]));
    }
}