老鼠走迷宫递归算法

一个二维数组0表示道路，2表示墙

int[][] maze = {{2, 2, 2, 2, 2, 2, 2},
                {2, 0, 0, 0, 0, 0, 2},
                {2, 0, 2, 0, 2, 0, 2},
                {2, 0, 0, 2, 0, 2, 2},
                {2, 2, 0, 2, 0, 2, 2},
                {2, 0, 0, 0, 0, 0, 2},
                {2, 2, 2, 2, 2, 2, 2}};

老鼠从索引（1,0）开始，请使用程序找出老鼠如何跑至索引（6,5）位置

public class Mouse {
    private int startI, startJ; // 入口
    private int endI, endJ; // 出口
    private boolean success = false;

    public static void main(String[] args) {
        int[][] maze = {{2, 2, 2, 2, 2, 2, 2},
                        {2, 0, 0, 0, 0, 0, 2},
                        {2, 0, 2, 0, 2, 0, 2},
                        {2, 0, 0, 2, 0, 2, 2},
                        {2, 2, 0, 2, 0, 2, 2},
                        {2, 0, 0, 0, 0, 0, 2},
                        {2, 2, 2, 2, 2, 2, 2}};
        
        System.out.println("显示迷宫：");
        for(int i = 0; i < maze.length; i++) {
            for(int j = 0; j < maze[0].length; j++) {
                if(maze[i][j] == 2) {
                    System.out.print("■");
                } else {
                    System.out.print("□");
                }
            }
            System.out.println();
        }

        Mouse mouse = new Mouse();
        mouse.setStart(1, 1);
        mouse.setEnd(5, 5);
        
        if(!mouse.go(maze)) {
            System.out.println("\n没有找到出口！");
        } else {
            System.out.println("\n找到出口！");
            for(int i = 0; i < maze.length; i++) {
                for(int j = 0; j < maze[0].length; j++) {
                    if(maze[i][j] == 2) {
                        System.out.print("■");
                    } else if(maze[i][j] == 1) {
                        System.out.print("◇");
                    } else {
                        System.out.print("□");
                    }
                }
                System.out.println();
            }
        }
    }
    
    public void setStart(int i, int j) {
        this.startI = i;
        this.startJ = j;
    }
      
    public void setEnd(int i, int j) {
        this.endI = i;
        this.endJ = j;
    }
      
    public boolean go(int[][] maze) {
        return visit(maze, startI, startJ);
    }
      
    private boolean visit(int[][] maze, int i, int j) {
        maze[i][j] = 1;

        if(i == endI && j == endJ) {
            success = true;
        }

        if(!success && maze[i][j+1] == 0) {
            visit(maze, i, j+1);
        }
        
        if(!success && maze[i+1][j] == 0) {
            visit(maze, i+1, j);
        }
        if(!success && maze[i][j-1] == 0) {
            visit(maze, i, j-1);
        }
        
        if(!success && maze[i-1][j] == 0) {
            visit(maze, i-1, j);
        }

        if(!success) {
            maze[i][j] = 0;
        }
        
        return success;
    }
}

思路分析：

在入口的位置，第一步有四种可能，第二步又有四种可能，递归。。。。。。