雪糕的最大数量

/*
 * Problem: Similar to the previous approach, we will use counting sort but in a more functional style using Java Streams.
 * We'll first count the frequencies, then sort and count the maximum ice creams that can be bought.
 */
import java.util.stream.IntStream;
import java.util.stream.Stream;

public class MaxIceCreamStream {
    public int maxIceCream(int[] costs, int coins) {
        int maxCost = 100000;
        int[] count = new int[maxCost + 1];
        // Counting the frequency of each cost using streams
        IntStream.of(costs).forEach(cost -> count[cost]++);
        int[] totalIceCreams = {0};
        // Using streams to iterate through the costs
        IntStream.range(1, maxCost + 1).forEach(i -> {
            if (coins < i) return; // If remaining coins are less than the current cost, stop further processing
            if (count[i] == 0) return; // If no ice cream of this cost, skip
            int maxBuyable = Math.min(count[i], coins / i); // Max ice creams that can be bought at this cost
            totalIceCreams[0] += maxBuyable;
            coins -= maxBuyable * i; // Deduct the cost from the coins
        });
        return totalIceCreams[0];
    }
}