解题思路:
广度优先搜索
注意事项:
参考代码:
import java.util.ArrayList; import java.util.Scanner; public class T1672 { public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = in.nextInt(); while(T-->0){ int N = in.nextInt(),M = in.nextInt(); char map[][] = new char[N+1][M+1];//迷宫 boolean visit[][] = new boolean[N+1][M+1];//是否被访问 int length[][] = new int[N+1][M+1];//长度记录 Point start = new Point(0,0); Point end = new Point(0,0); int ans = -1; int [][]dir = {{-1,0},{1,0},{0,-1},{0,1}}; for(int i = 1;i<=N;i++){ String s = in.next(); for(int j = 1;j<=M;j++){ map[i][j] = s.charAt(j-1); if(map[i][j] == 'S') start.set_xy(i, j); else if(map[i][j] == 'E') end.set_xy(i, j); } } ArrayList<Point> queue = new ArrayList<Point>(); queue.add(start); length[start.x][start.y] = 0; visit[start.x][start.y] = true; s: while(!queue.isEmpty()){ for(int i = 0;i<4;i++){ Point tmp = new Point(queue.get(0).x + dir[i][0], queue.get(0).y + dir[i][1]); if(tmp.x>0&&tmp.x<=N&&tmp.y>0&&tmp.y<=M&&map[tmp.x][tmp.y] != '#'&&visit[tmp.x][tmp.y]==false){ if(map[tmp.x][tmp.y] == 'E'){ ans = length[queue.get(0).x][queue.get(0).y]+1; break s; } visit[tmp.x][tmp.y] = true; queue.add(tmp); length[tmp.x][tmp.y] = length[queue.get(0).x][queue.get(0).y]+1; } } queue.remove(0); } System.out.println(ans); } in.close(); } } class Point{ int x; int y; public Point(int x,int y){ this.x = x; this.y = y; } public void set_xy(int x,int y){ this.x = x; this.y = y; } }
0.0分
1 人评分
C二级辅导-阶乘数列 (C语言代码)浏览:618 |
C语言程序设计教程(第三版)课后习题10.5 (C语言代码)浏览:733 |
C语言训练-计算:t=1-1/(2*2)-1/(3*3)-...-1/(m*m) (C语言代码)浏览:785 |
2005年春浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:591 |
【明明的随机数】 (C语言代码)浏览:787 |
1157题解浏览:716 |
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:561 |
矩形面积交 (C语言代码)浏览:1313 |
敲七 (C++代码)浏览:1056 |
C语言程序设计教程(第三版)课后习题8.1 (C语言代码)浏览:721 |