回溯解迷宫寻路

////////////////////迷宫回溯///////////////
public class Test {
    public static void main(String[] args) {

        int[][] m = new int[10][10];

        //初始化迷宫
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                m[i][j] = 0;
            }
        }

        //设定外墙
        for (int i = 0; i < 10; i++) {
            m[0][i] = 1;
            m[9][i] = 1;
            m[i][0] = 1;
            m[i][9] = 1;
        }

        //墙
        m[5][1] = 1;
        m[5][2] = 1;
        m[5][3] = 1;
        m[5][4] = 1;
        m[4][4] = 1;
        m[3][3] = 1;
        //输出
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                System.out.print(m[i][j] + " ");
            }
            System.out.println();
        }
        System.out.println();
        boolean hs = hs(m, 1, 1);


        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                System.out.print(m[i][j] + " ");
            }
            System.out.println();
        }
    }

    //回溯寻路
    //0未走过 1墙 2正确的路 3死路
    public static boolean hs(int[][] m, int i, int j) {
        if (m[8][8] == 2) {
            return true;
        } else {
            if (m[i][j] == 0) {
                m[i][j] = 2;
                if (hs(m, i + 1, j)) {
                    return true;
                } else if (hs(m, i, j + 1)) {
                    return true;
                } else if (hs(m, i - 1, j)) {
                    return true;
                } else if (hs(m, i, j - 1)) {
                    return true;
                } else {
                    m[i][j] = 3;
                    return false;
                }
            }else {
                return false;
            }
        }
    }
}