迷宫瞎搞搞

import java.util.*;

class Position{
    public Position(){}
    public Position(int row, int col){
        this.col = col;
        this.row = row;
    }
    public String toString(){
        return "(" + row + " ," + col + ")";
    }
    int row;
    int col;
}

class Maze{
    public Maze(){
        stack = new Stack<Position>();
        p = new boolean[15][15];
    }


    /*
     * 回溯迷宫，查看是否有出路
     */
    public void findPath(){
       	//迷宫原始数据
        int row = 4;
        int col = 4;
        int[][] maze = {{0,0,1,1},{1,0,0,1},{1,1,0,0},{1,1,1,0}};
        // 给原始迷宫的周围家一圈围墙
       
        int temp[][] = new int[row + 2][col + 2];
        for(int i = 0; i < row + 2; ++i) {
            for(int j = 0; j < col + 2; ++j) {
                temp[0][j] = 1;
                temp[row + 1][j] = 1;
                temp[i][0] = temp[i][col + 1] = 1;
            }
        }
        // 将原始迷宫复制到新的迷宫中
        for(int i = 0; i < row; ++i) {
            for(int j = 0; j < col; ++j) {
                temp[i + 1][j + 1] = maze[i][j];
            }
        }

        // 迷宫入口
        int i = 1;
        int j = 2;

        p[i][j] = true;
        stack.push(new Position(i, j));
        while (!stack.empty() && (!(i == (row) && (j == col)))) {

            if ((temp[i][j + 1] == 0) && (p[i][j + 1] == false)) {
                p[i][j + 1] = true;
                stack.push(new Position(i, j + 1));
                j++;
            } else if ((temp[i + 1][j] == 0) && (p[i + 1][j] == false)) {
                p[i + 1][j] = true;
                stack.push(new Position(i + 1, j));
                i++;
            } else if ((temp[i][j - 1] == 0) && (p[i][j - 1] == false)) {
                p[i][j - 1] = true;
                stack.push(new Position(i, j - 1));
                j--;
            } else if ((temp[i - 1][j] == 0) && (p[i - 1][j] == false)) {
                p[i - 1][j] = true;
                stack.push(new Position(i - 1, j));
                i--;
            } else {
                stack.pop();
                if(stack.empty()){
                    break;
                }
                i = stack.peek().row;
                j = stack.peek().col;
            }

        }

        Stack<Position> newPos = new Stack<Position>();
        if (stack.empty()) {
            System.out.println("没有路径");
        } else {
            System.out.println("有路径");
            System.out.println("路径如下：");
            while (!stack.empty()) {
                Position pos = new Position();
                pos = stack.pop();
                newPos.push(pos);
            }
        }

        /*
         * 图形化输出路径
         * */

        String resault[][]=new String[row+1][col+1];
        for(int k=0;k<row;++k){
            for(int t=0;t<col;++t){
                resault[k][t]=(maze[k][t])+"";
            }
        }
        while (!newPos.empty()) {
            Position p1=newPos.pop();
            resault[p1.row-1][p1.col-1]="#";

        }

        for(int k=0;k<row;++k){
            for(int t=0;t<col;++t){
                System.out.print(resault[k][t]+"\t");
            }
            System.out.println();
        }


    }

    int maze[][];
    private int row = 3;
    private int col = 4;
    Stack<Position> stack;
    boolean p[][] = null;
}

class hello{
    public static void main(String[] args){
        Maze demo = new Maze();
        demo.findPath();
    }
}

有路径
路径如下：
0 # 1 1
1 # # 1
1 1 # #
1 1 1 #

进程已结束，退出代码为 0