你能从盒子里获得的最大糖果数

/**
 * Solution using Java Streams to find the maximum number of candies.
 * This solution processes the initial set of boxes and dynamically expands
 * the set of accessible boxes using Streams. This approach is less optimal
 * than the queue-based solution for real-world use but demonstrates the use
 * of functional programming style.
 */
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class MaximumCandiesStream {
    public int maxCandies(int[] status, int[] candies, int[][] keys, int[][] containedBoxes, int[] initialBoxes) {
        Set<Integer> accessibleBoxes = new HashSet<>();
        Set<Integer> foundBoxes = new HashSet<>();
        Set<Integer> collectedKeys = new HashSet<>();
        int totalCandies = 0;

        Collections.addAll(foundBoxes, Arrays.stream(initialBoxes).boxed().toArray(Integer[]::new));

        boolean progress = true;
        while (progress) {
            progress = false;
            for (int box : foundBoxes) {
                if ((status[box] == 1 || collectedKeys.contains(box)) && accessibleBoxes.add(box)) {
                    totalCandies += candies[box];
                    collectedKeys.addAll(Arrays.stream(keys[box]).boxed().collect(Collectors.toSet()));
                    foundBoxes.addAll(Arrays.stream(containedBoxes[box]).boxed().collect(Collectors.toSet()));
                    progress = true;
                }
            }
        }
        return totalCandies;
    }
}