使用堆栈的迷宫中的老鼠(Java)

import java.util.Stack;

public class MazeSolver {
    private static final int[][] DIRECTIONS = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; // 可行的四个方向：右、下、左、上

    public static boolean solveMaze(int[][] maze, int startX, int startY, int endX, int endY) {
        int rows = maze.length;
        int cols = maze[0].length;
        boolean[][] visited = new boolean[rows][cols]; // 记录已访问的位置
        Stack<int[]> stack = new Stack<>(); // 使用堆栈来保存路径

        stack.push(new int[]{startX, startY}); // 将起点入栈

        while (!stack.isEmpty()) {
            int[] current = stack.pop();
            int x = current[0];
            int y = current[1];

            if (x == endX && y == endY) {
                return true; // 找到终点，迷宫解决成功
            }

            visited[x][y] = true; // 标记当前位置为已访问

            for (int[] direction : DIRECTIONS) {
                int newX = x + direction[0];
                int newY = y + direction[1];

                if (isValidMove(maze, newX, newY, visited)) {
                    stack.push(new int[]{newX, newY}); // 将可行的下一个位置入栈
                }
            }
        }

        return false; // 无法找到从起点到终点的路径
    }

    private static boolean isValidMove(int[][] maze, int x, int y, boolean[][] visited) {
        int rows = maze.length;
        int cols = maze[0].length;

        // 判断位置是否越界，是否是墙，是否已经访问过
        return x >= 0 && x < rows && y >= 0 && y < cols && maze[x][y] == 0 && !visited[x][y];
    }

    public static void main(String[] args) {
        int[][] maze = {
                {0, 1, 0, 0, 0},
                {0, 1, 0, 1, 0},
                {0, 0, 0, 0, 0},
                {0, 1, 1, 1, 0},
                {0, 0, 0, 1, 0}
        };

        int startX = 0;
        int startY = 0;
        int endX = 4;
        int endY = 4;

        if (solveMaze(maze, startX, startY, endX, endY)) {
            System.out.println("迷宫解决成功！");
        } else {
            System.out.println("无法找到路径！");
        }
    }
}