解题思路:以为很难,没想到就是走迷宫的原题 就是方向变了
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | import java.util.LinkedList; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int [][] direction = { { - 1 , - 2 }, { - 2 , - 1 }, { - 2 , 1 }, { - 1 , 2 }, { 1 , - 2 }, { 2 , - 1 }, { 2 , 1 }, { 1 , 2 } }; for ( int i = 0 ; i < n; i++) { int L = sc.nextInt(); int [][] arr = new int [L + 1 ][L + 1 ]; int startx = sc.nextInt(); int starty = sc.nextInt(); int endx = sc.nextInt(); int endy = sc.nextInt(); if (startx == endx && endy == starty) { System.out.println( 0 ); continue ; } int k = 0 ; boolean iRet = true ; LinkedList<nnn> queue = new LinkedList<nnn>(); queue.add( new nnn(startx, starty, 0 )); arr[startx][starty] = 1 ; while (!queue.isEmpty()) { nnn d = queue.poll(); k = d.step; if (d.x == endx && d.y == endy) { System.out.println(d.step); iRet = false ; break ; } for ( int j = 0 ; j < direction.length; j++) { int x = d.x + direction[j][ 0 ]; int y = d.y + direction[j][ 1 ]; if (x >= 0 && y >= 0 && x < L && y < L && arr[x][y] == 0 ) { arr[x][y] = 1 ; queue.addLast( new nnn(x, y, d.step + 1 )); } } } if (iRet)System.out.println(k); } } } class nnn { public int x; public int y; public int step; public nnn( int x, int y, int step) { this .x = x; this .y = y; this .step = step; } } |
9.9 分
3 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复