分享 K 个糖果后独特口味的数量

// Problem: Leetcode 2107 - Number of Unique Flavors After Sharing K Candies
// Given a list of candies, where each candy has a unique flavor, the task is to find the number of unique flavors left after sharing exactly K candies.

// Approach:
// 1. Use Java Streams to filter and count unique flavors after sharing K candies.
// 2. Utilize the distinct() method to find unique elements and limit() to consider only the first K elements.

import java.util.Arrays;
import java.util.Set;
import java.util.stream.Collectors;

public class SolutionStream {
    public int shareCandies(int[] candies, int k) {
        Set<Integer> uniqueFlavors = Arrays.stream(candies)
                .limit(k)
                .boxed()
                .collect(Collectors.toSet());

        return uniqueFlavors.size();
    }
}