[Leetcode] 490. The Maze 解题报告

魔豆Magicbean

于 2017-12-04 12:07:36 发布

阅读量5.4k

点赞数 2

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 DFS BFS

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/78706612

版权

本文介绍LeetCode第490题《The Maze》的解题报告，讨论如何使用DFS和BFS解决寻找球能否到达目的地的问题。解析了题意，强调了球必须在目的地停止的条件，并提供了DFS和BFS的解题策略。在DFS中，当到达目的地或访问过的位置时返回结果；在BFS中，利用队列进行搜索，直到找到到达目的地的路径或队列为空。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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

最低0.47元/天解锁文章