购买巧克力后的最小相对损失

/*
 * LeetCode 2819: Minimum Relative Loss After Buying Chocolates
 * 
 * Problem: Given an array of prices of chocolates and an integer k, we need to find the minimum relative loss
 *          if we buy exactly k chocolates. The relative loss is defined as the difference between the maximum
 *          and the minimum prices of the k chocolates purchased.
 * 
 * Approach using Java Streams:
 * 1. Sort the array of prices using Streams.
 * 2. Initialize the minimum loss to the highest possible value.
 * 3. Iterate through the sorted array, checking the relative loss for each consecutive subarray of size k.
 * 4. Update the minimum loss accordingly.
 */

import java.util.Arrays;
import java.util.stream.IntStream;

public class MinimumRelativeLossStream {
    public int minRelativeLoss(int[] prices, int k) {
        int[] sortedPrices = Arrays.stream(prices).sorted().toArray();
        return IntStream.range(0, sortedPrices.length - k + 1)
                        .map(i -> sortedPrices[i + k - 1] - sortedPrices[i])
                        .min()
                        .orElse(Integer.MAX_VALUE);
    }

    public static void main(String[] args) {
        MinimumRelativeLossStream solution = new MinimumRelativeLossStream();
        int[] prices = {5, 9, 1, 3, 8};
        int k = 3;
        System.out.println(solution.minRelativeLoss(prices, k));  // Output should be 4
    }
}