通过dfs深度优先遍历的方法实现了迷宫三。
import java.util.*;
class Main{
public static String[] mp = new String[16];
public static int[][] visit = new int[16][16];;
public static int n,m,min=20000;
public static int dx[] = {0,0,1,-1};
public static int dy[] = {1,-1,0,0};
public static void main(String [] args){
Scanner scanner=new Scanner(System.in);
n=scanner.nextInt();
m=scanner.nextInt();
for (int i = 0; i < n; i++) {
mp[i] = scanner.next();
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if(mp[i].charAt(j) == '@') {
visit[i][j]=1;
dfs(i,j,0);
}
}
}
if(min==20000) {
System.out.println(-1);
}else {
System.out.println(min);
}
}
public static void dfs(int x0,int y0,int step){
if(step>min){
return;
}
if(mp[x0].charAt(y0)=='.' && x0==0 || y0==0 || x0==n-1 || y0==m-1) {
if(step<min) {
min=step;
}
return;
}
for(int i=0;i<4;i++){
int x=x0+dx[i];
int y=y0+dy[i];
if(x>=0 && x<n && y>=0 && y<m && visit[x][y]==0
&& mp[x].charAt(y)!='#' && mp[x].charAt(y)!='T'){
visit[x][y]=1;
dfs(x, y,step+1);
visit[x][y]=0;
}
}
}
}