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

---

迷宫问题

一、问题描述

二、源代码

代码如下（示例）：

package recurtion;

public class Migong {
    public static void main(String arg[]) {
        int[][] map = new int[8][7];
        for (int i = 0; i < map.length; i++) {
            map[i][0] = 1;
            map[i][6] = 1;
        }
        for (int i = 0; i < map[0].length; i++) {
            map[0][i] = 1;
            map[7][i] = 1;
        }
        map[3][1] = 1;
        map[3][2] = 1;
/*        map[1][2] = 1;
        map[2][2] = 1;*/
/*        for (int[] row :map) {
            for (int i:row) {
                System.out.print(i+" ");
            }
            System.out.println();
        }*/
        Setways(map, 1, 1);
        for (int[] row : map) {
            for (int i : row) {
                System.out.print(i + " ");
            }
            System.out.println();
        }
    }

    public static boolean Setways(int[][] map, int i, int j) {
        if (map[6][5] == 2) {
            return true;
        } else {
            if (map[i][j] == 0) {
                map[i][j] = 2;
                if (Setways(map, i + 1, j)) {
                    return true;
                } else if (Setways(map, i, j + 1)) {
                    return true;
                } else if (Setways(map, i - 1, j)) {
                    return true;
                } else if (Setways(map, i, j - 1)) {
                    return true;
                } else {
                    map[i][j] = 3;
                    return false;
                }
            }else {
                return false;
            }
        }
    }
}

总结

debug一遍，才明白…