490. The Maze
来源:互联网 发布:黑马28期java就业班 编辑:程序博客网 时间:2024/06/02 03:40
There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won't stop rolling until hitting a wall. When the ball stops, it could choose the next direction.
Given the ball's start position, the destination and the maze, determine whether the ball could stop at the destination.
The maze is represented by a binary 2D array. 1 means the wall and 0 means the empty space. You may assume that the borders of the maze are all walls. The start and destination coordinates are represented by row and column indexes.
Example 1
Input 1: a maze represented by a 2D array0 0 1 0 00 0 0 0 00 0 0 1 01 1 0 1 10 0 0 0 0Input 2: start coordinate (rowStart, colStart) = (0, 4)Input 3: destination coordinate (rowDest, colDest) = (4, 4)Output: trueExplanation: One possible way is : left -> down -> left -> down -> right -> down -> right.
Example 2
Input 1: a maze represented by a 2D array0 0 1 0 00 0 0 0 00 0 0 1 01 1 0 1 10 0 0 0 0Input 2: start coordinate (rowStart, colStart) = (0, 4)Input 3: destination coordinate (rowDest, colDest) = (3, 2)Output: falseExplanation: There is no way for the ball to stop at the destination.
Note:
- There is only one ball and one destination in the maze.
- Both the ball and the destination exist on an empty space, and they will not be at the same position initially.
- The given maze does not contain border (like the red rectangle in the example pictures), but you could assume the border of the maze are all walls.
- The maze contains at least 2 empty spaces, and both the width and height of the maze won't exceed 100.
public class Solution { class Point { int x; int y; public Point(int _x, int _y) { x = _x; y = _y;} } public boolean hasPath(int[][] maze, int[] start, int[] destination) { int m = maze.length; int n = maze[0].length; boolean[][] visited = new boolean[m][n]; Queue<Point> queue = new LinkedList<Point>(); queue.offer(new Point(start[0], start[1])); int[][] dirs = new int[][]{{1,0},{-1,0},{0,1},{0,-1}}; while (!queue.isEmpty()) { Point p = queue.poll(); for (int[] dir: dirs) { int xx = p.x, yy = p.y; while (xx >= 0 && yy >= 0 && xx < m && yy < n && maze[xx][yy] == 0) { xx += dir[0]; yy += dir[1]; } xx -= dir[0]; yy -= dir[1]; if (visited[xx][yy]) { continue; } visited[xx][yy] = true; if (xx == destination[0] && yy == destination[1]) { return true; } queue.offer(new Point(xx, yy)); } } return false; }}
阅读全文
0 0
- 490. The Maze
- [Leetcode] 490. The Maze 解题报告
- GoogleJam_Cross the maze
- LightOJ1337 - The Crystal Maze
- The Maze Makers
- LightOJ1337_ The Crystal Maze
- 505. The Maze II
- CSU1566-The Maze Makers
- 走迷宫 the maze problem
- Problem D. Cross the maze
- CSU1566: The Maze Makers(BFS)
- CSU 1566The Maze Makers
- The Maze runner(BFS)
- CSU 1566The Maze Makers
- 171210 逆向-Take the maze
- Maze
- maze
- Maze
- thread07
- 最新版本Sublime Text设置自动保存
- MySQL 学习<十四> 数据备份与恢复
- linux4-4设备树学习的小小感悟以及源码下载
- 【感悟】--java工作两年技术反省(226)
- 490. The Maze
- thread08
- Servlet
- java所有监听器及常用监听器学习(EventListener)
- 505. The Maze II
- BOM
- 节点
- jsp--cookie
- MyEclipse10破解后续~~~~破解不成功