递归(迷宫)
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/7a7ca4502f8ee8192b6e30508efc6374.png)
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;
}
for(int i = 2; i < 8;i++){
map[i][2] = 1;
}
T t = new T();
t.findWay(map,1,1);
for(int i = 0; i < map.length; i++){
for(int j = 0; j < map[i].length; j++){
System.out.print(map[i][j] + " ");
}
System.out.println();
}
}
}
class T {
public boolean findWay(int[][] map,int i,int j){
if(map[6][5] == 2){
return true;
}else {
if(map[i][j] == 0){
map[i][j] = 2;
if(findWay(map, i + 1, j)){
return true;
}else if(findWay(map, i, j +1)){
return true;
}else if(findWay(map, i - 1, j)){
return true;
}else if(findWay(map, i , j - 1)){
return true;
}else{
map[i][j] = 3;
return false;
}
}else{
return false;
}
}
}
}