最大线性股票得分

/*
 * Leetcode 2898 - Maximum Linear Stock Score
 * 
 * Problem Statement:
 * Given an array of stock prices, find the maximum score by selecting a subarray and summing up its elements.
 * 
 * Approach using Java Stream:
 * - We can use Java Stream to process the array and calculate the maximum subarray sum.
 * - Use a custom collector to keep track of the current and maximum scores while traversing the array.
 */

import java.util.stream.IntStream;

public class MaxLinearStockScoreStream {
    public int maxScore(int[] prices) {
        return IntStream.of(prices).collect(() -> new int[]{0, 0},
                (acc, price) -> {
                    acc[0] = Math.max(0, acc[0] + price);
                    acc[1] = Math.max(acc[1], acc[0]);
                },
                (acc1, acc2) -> {
                    acc1[0] = Math.max(acc1[0], acc2[0]);
                    acc1[1] = Math.max(acc1[1], acc2[1]);
                })[1];
    }

    public static void main(String[] args) {
        MaxLinearStockScoreStream solution = new MaxLinearStockScoreStream();
        int[] prices = {1, -2, 3, 10, -4, 7, 2, -5};
        System.out.println(solution.maxScore(prices)); // Output: 18
    }
}