经营摩天轮的最大利润

/*
 * Approach using Java Streams:
 * 1. Use Java streams to process the customer array and calculate profits and rotations in a functional manner.
 * 2. Accumulate the total waiting customers and calculate the boarding and profit in each step.
 * 3. Track the maximum profit and corresponding number of rotations.
 */
import java.util.stream.IntStream;

public class FerrisWheelProfitStream {
    public int minOperationsMaxProfit(int[] customers, int boardingCost, int runningCost) {
        int[] maxProfitData = {0, -1};
        int[] currentWaiting = {0};
        int[] totalProfit = {0};
        int[] rotations = {0};

        IntStream.range(0, customers.length).forEach(i -> {
            currentWaiting[0] += customers[i];
            int boardingCustomers = Math.min(currentWaiting[0], 4);
            currentWaiting[0] -= boardingCustomers;
            totalProfit[0] += (boardingCustomers * boardingCost) - runningCost;
            rotations[0]++;
            if (totalProfit[0] > maxProfitData[0]) {
                maxProfitData[0] = totalProfit[0];
                maxProfitData[1] = rotations[0];
            }
        });

        while (currentWaiting[0] > 0) {
            int boardingCustomers = Math.min(currentWaiting[0], 4);
            currentWaiting[0] -= boardingCustomers;
            totalProfit[0] += (boardingCustomers * boardingCost) - runningCost;
            rotations[0]++;
            if (totalProfit[0] > maxProfitData[0]) {
                maxProfitData[0] = totalProfit[0];
                maxProfitData[1] = rotations[0];
            }
        }

        return maxProfitData[0] > 0 ? maxProfitData[1] : -1;
    }

    public static void main(String[] args) {
        FerrisWheelProfitStream solution = new FerrisWheelProfitStream();
        int[] customers = {8, 3};
        int boardingCost = 5;
        int runningCost = 6;
        System.out.println(solution.minOperationsMaxProfit(customers, boardingCost, runningCost)); // Output: 3
    }
}