递归的应用-迷宫回溯
此代码仅供找到出口,并不能找到最短路径,如果找到纯属巧合。
没出口的话会出现3;
public class MiGong {
public static void main(String[] args) {
//县创建一个二维数组模拟迷宫
int[][] map = new int[8][7];
//使用1表示墙
for (int i = 0; i < 7; i++){
map[0][i] = 1;
map[7][i] = 1;
}
map[3][1] = 1;
map[3][2] = 1;
map[3][4] = 1;
map[3][5] = 1;
map[3][6] = 1;
//左右
for (int i = 0; i < 8; i++){
map[i][0] = 1;
map[i][6] = 1;
}
for (int i = 0; i < 8; i++){
for (int j = 0; j < 7; j++){
System.out.print(map[i][j]+" ");
}
System.out.println();
}
setWay(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();
}
}
/**
* 迷宫回溯问题
* @param map 模拟迷宫
* @param i 行坐标
* @param j 列坐标
* @return true
*/
public static boolean setWay(int[][] map, int i, int j){
if (map[6][5] == 2){
return true;
}else {
if (map[i][j] == 0){
map[i][j] = 2;
//先右走,不行下,再不行左,再不行上,再不行走不通
if (setWay(map, i, j + 1)){
return true;
}else if (setWay(map, i + 1, j)){
return true;
}else if (setWay(map, i, j-1)){
return true;
}else if (setWay(map, i - 1, j)){
return true;
}else {
map[i][j] = 3;
return false;
}
}else {
return false;
}
}
}
}