该问题要求在给定的网格中找到从起点到任意食物单元的最短路径。使用宽度优先搜索(BFS)策略，从起点开始，逐层探索直到找到食物单元。在探索过程中，遇到障碍物则跳过，遇到空格则继续移动，找到食物后返回步数。若无法到达食物，则返回-1。算法实现包括维护一个队列，记录已访问过的单元并将其标记为障碍物以避免重复计算。
You are starving and you want to eat food as quickly as possible. You want to find the shortest path to arrive at any food cell.
You are given an m x n character matrix, grid, of these different types of cells:
'*'is your location. There is exactly one'*'cell.'#'is a food cell. There may be multiple food cells.'O'is free space, and you can travel through these cells.'X'is an obstacle, and you cannot travel through these cells.
You can travel to any adjacent cell north, east, south, or west of your current location if there is not an obstacle.
Return the length of the shortest path for you to reach any food cell. If there is no path for you to reach food, return -1.
E
最低0.47元/天 解锁文章
扫一扫
1400
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
