递归实现迷宫

package data;

/**递归实现迷宫
   没有实现找最短路径
 * @author Babulakaka
 * @create 2021-06-13 10:00
 */
public class Recursion5 {
    public static void main(String[] args) {
        int[][] map = new int[10][10];
        //1 代表墙
        for (int i = 0; i < 10; i++) {
            map[i][0] = 1;
            map[i][9] = 1;
        }
        for (int i = 0; i < 10; i++) {
            map[0][i] = 1;
            map[9][i] = 1;
        }
        map[5][1] = 1;
        map[5][2] = 1;
        map[5][3] = 1;
        map[3][5] = 1;
        map[3][6] = 1;
        map[3][7] = 1;
        map[3][8] = 1;

        for (int[] a : map) {
            for (int data : a) {
                System.out.print(data + " ");
            }
            System.out.println();
        }
        //是否能找到出口
        System.out.println(maze(map, 1, 1));
        //看走过的路径
        for (int[] a : map) {
            for (int data : a) {
                System.out.print(data + " ");
            }
            System.out.println();
        }

    }

    public static boolean maze(int[][] map, int startX, int startY) {
        //2代表走过的路
        if (map[8][8] == 2) {
            return true;
        } else {
            if (map[startX][startY] == 0) {
                map[startX][startY] = 2;
                if (maze(map, startX, startY - 1)) {//向左试探
                    return true;
                } else if (maze(map, startX + 1, startY)) {//向下试探
                    return true;
                } else if (maze(map, startX, startY + 1)) {//向右试探
                    return true;
                } else if (maze(map, startX - 1, startY)) {//向上试探
                    return true;
                }else {
                    map[startX][startY]=3;//3表示走不通的路
                    return  false;
                }
            } else {
                return false;
            }
        }

    }
}