价格递增的最大利润三元组 II

/*
 * Solution for LeetCode problem 2921: 价格递增的最大利润三元组 II using Java Streams
 * This approach leverages Java Streams to handle the operations more functionally.
 */

import java.util.stream.IntStream;

public class MaxProfitTripletStream {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        if (n < 3) return 0;

        int[] leftMin = new int[n];
        leftMin[0] = prices[0];
        for (int i = 1; i < n; i++) {
            leftMin[i] = Math.min(leftMin[i - 1], prices[i]);
        }

        return IntStream.range(1, n - 1).flatMap(j ->
            IntStream.range(j + 1, n)
                .filter(k -> prices[j] > leftMin[j - 1] && prices[k] > prices[j])
                .map(k -> prices[k] - leftMin[j - 1])
        ).max().orElse(0);
    }

    public static void main(String[] args) {
        MaxProfitTripletStream solution = new MaxProfitTripletStream();
        int[] prices = {3, 1, 4, 1, 5, 9, 2, 6};
        System.out.println(solution.maxProfit(prices)); // Output should be the maximum profit
    }
}