拥有最多糖果的孩子

// Solution for LeetCode problem using Java Streams

/*
 * Approach:
 * 1. Find the maximum number of candies any child currently has using streams.
 * 2. Use streams to map each child's candies to a boolean indicating if they can
 *    have the maximum number of candies by adding extraCandies.
 */

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

public class Solution {
    public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
        int maxCandies = Arrays.stream(candies).max().orElse(0);
        
        return Arrays.stream(candies)
                     .mapToObj(candy -> candy + extraCandies >= maxCandies)
                     .collect(Collectors.toList());
    }
}