变换的迷宫

/*
 * 思路：
 * 使用Java Stream API重写同样的逻辑。
 */
import java.util.*;
import java.util.stream.Collectors;

public class MazeSolverStream {
    private static final int[] directions = {-1, 0, 1, 0, -1};

    public boolean canEscape(String[][] maze) {
        int T = maze.length;
        int N = maze[0].length;
        int M = maze[0][0].length();
        boolean[][][] visited = new boolean[T][N][M];
        Queue<int[]> queue = new LinkedList<>();
        queue.add(new int[]{0, 0, 0});
        visited[0][0][0] = true;

        while (!queue.isEmpty()) {
            List<int[]> currentLevel = queue.stream().collect(Collectors.toList());
            queue.clear();

            for (int[] current : currentLevel) {
                int t = current[0], x = current[1], y = current[2];

                if (x == N - 1 && y == M - 1) {
                    return true;
                }

                for (int i = 0; i < 4; i++) {
                    int nx = x + directions[i];
                    int ny = y + directions[i + 1];
                    int nt = t + 1;
                    if (nx >= 0 && ny >= 0 && nx < N && ny < M && nt < T && !visited[nt][nx][ny] && maze[nt].charAt(nx) == '.') {
                        visited[nt][nx][ny] = true;
                        queue.add(new int[]{nt, nx, ny});
                    }
                }
            }
        }

        return false;
    }
}