数据结构与算法-递归（迷宫问题）

package com.tk.recursion;

public class maze {
    public static void main(String[] args) {
        int[][] map = new int[8][7];
        for (int i = 0; i < 7; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }
        for (int i = 0; i < 8; i++) {
            map[i][0] = 1;
            map[i][6] = 1;
        }
        map[3][1] = 1;
        map[3][2] = 1;

        System.out.println("地图：");
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j] + " ");
            }
            System.out.println();
        }
        //从第二行，第二列开始走
        getWay(map, 1, 1);

        System.out.println("路线：");
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j] + " ");
            }
            System.out.println();
        }
    }

    
    public static boolean getWay(int[][] map, int i, int j) {
        //递归出口
        if (map[6][5] == 2) {
            return true;
        } else {
            //该点没有走过
            if (map[i][j] == 0) {
                //假设该点是通路
                map[i][j] = 2;
                if (getWay(map, i, j + 1)) {//向右
                    return true;
                } else if (getWay(map, i + 1, j)) {//向下
                    return true;
                } else if (getWay(map, i, j - 1)) {//向左
                    return true;
                } else if (getWay(map, i - 1, j)) {//向上
                    return true;
                } else {
                    //都不满足，说明都走过了还是不通
                    map[i][j] = 3;
                    return false;
                }
            } else {
                return false;
            }
        }
    }
}