迷宫中离入口最近的出口

/**
 * Similar to the Java solution but using Java Streams to process the queue operations and directions.
 * Streams allow us to work with data in a declarative way, making the code more readable.
 * The logic remains the same as we perform BFS to find the nearest exit.
 */
import java.util.*;
import java.util.stream.*;

public class SolutionStream {
    public int nearestExit(char[][] maze, int[] entrance) {
        int rows = maze.length;
        int cols = maze[0].length;
        int[][] directions = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
        Queue<int[]> queue = new LinkedList<>();
        queue.offer(new int[]{entrance[0], entrance[1]});
        maze[entrance[0]][entrance[1]] = '+';
        int steps = 0;

        while (!queue.isEmpty()) {
            int size = queue.size();
            steps++;
            queue = IntStream.range(0, size)
                .mapToObj(i -> queue.poll())
                .flatMap(point -> Arrays.stream(directions)
                    .map(dir -> new int[]{point[0] + dir[0], point[1] + dir[1]})
                    .filter(newPoint -> newPoint[0] >= 0 && newPoint[1] >= 0 && newPoint[0] < rows && newPoint[1] < cols && maze[newPoint[0]][newPoint[1]] == '.')
                    .peek(newPoint -> maze[newPoint[0]][newPoint[1]] = '+')
                    .peek(newPoint -> {
                        if (newPoint[0] == 0 || newPoint[1] == 0 || newPoint[0] == rows - 1 || newPoint[1] == cols - 1) throw new RuntimeException(String.valueOf(steps));
                    })
                ).collect(Collectors.toCollection(LinkedList::new));
        }
        return -1;
    }
}