递归地宫问题

package com.ants;

import java.util.TreeSet;

/**
 * 迷宫地宫回溯问题
 */
public class MiGong {
    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;
        map[3][5] = 1;
        for (int i = 0; i < 8; i++) {
            for (int i1 = 0; i1 < 7; i1++) {
                System.out.print(map[i][i1]+" ");
            }
            System.out.println();
        }
        migong(map,1,1);
        System.out.println("找路后的路径------------------------------");
        for (int i = 0; i < 8; i++) {
            for (int i1 = 0; i1 < 7; i1++) {
                System.out.print(map[i][i1]+" ");
            }
            System.out.println();
        }
    }

    /**
     * @param map 地图
     * @param xIndex xindex
     * @param yIndex yindex
     * @return 返回是否到达
     */
    public static boolean migong(int[][] map,int xIndex,int yIndex){
//        已经找到
        if (map[6][5]==2){
            return true;
        }else {
            if (map[xIndex][yIndex]==0){
//                当前所在位置
                map[xIndex][yIndex]=2;
                if (migong(map,xIndex,yIndex+1)){  //向下走
                    return true;
                }else if (migong(map,xIndex+1,yIndex)){ //向右走
                    return true;
                }else if (migong(map,xIndex-1,yIndex)){//向上走
                    return true;
                }else if (migong(map,xIndex,yIndex-1)){//向左走
                    return true;
                }else {
//                    死路
                    map[xIndex][yIndex] = 3;
                    return false;
                }
            }else {   //不等于0,则可能是  1 2 3 1为墙 2已经走过了 3为死路
                return false;
            }
        }
    }
}