迷宫问题

import java.util.*;


public class 迷宫 {
     static Position[][] maze = new Position[8][8];

        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            for (int i = 0; i < 8; i++) {// 全部初始化，不然搜索的时候会报错
                for (int j = 0; j < 8; j++) {
                    maze[i][j] = new Position(i, j, 1);// 人工建墙，围上迷宫，免得判范围
                }
            }
            int[][] operate = { { 0, -1 }, { 0, 1 }, { -1, 0 }, { 1, 0 } };// 表驱动法代替连续if
            for (int i = 1; i <= 5; i++) {
                for (int j = 1; j <= 5; j++) {
                    maze[i][j].value = sc.nextInt();
                }
            }
            Queue<Position> wait = new LinkedList<Position>();
            wait.add(maze[1][1]);
            while (!wait.isEmpty()) {
                Position cur = wait.poll();
                if (cur.x == 5 && cur.y == 5)
                {
                    // 写了个递归，从终点开始回退，到达起点为止开始输出，达到题目从头输出的要求
                    outPut(5, 5);
                    break;
                }
                cur.value = 1;// 标记为走过
                for (int i = 0; i < 4; i++) {
                    int nextX = cur.x + operate[i][0];
                    int nextY = cur.y + operate[i][1];
                    if (maze[nextX][nextY].value == 0) {
                        wait.add(maze[nextX][nextY]);
                        maze[nextX][nextY].pre = cur;// 链式记录
                    }
                }
            }
        }

        public static void outPut(int x, int y) {
            if (maze[x][y].pre == null) {
                System.out.println("(0, 0)");
                return;
            }
            outPut(maze[x][y].pre.x, maze[x][y].pre.y);
            int realX = x - 1;
            int realY = y - 1;
            System.out.println("(" + realX + ", " + realY + ")");
        }
    }

    class Position {
        int x;
        int y;
        int value;
        Position pre;

        public Position(int x, int y, int value) {
            this.x = x;
            this.y = y;
            this.value = value;
        }

}