1091.二进制矩阵中的最短路径
示例 1:
示例 2:
提示:
- 1 <= grid.length == grid[0].length <= 100
- grid[i][j] 为 0 或 1
实现:
class Solution:
class Solution:
def shortestPathBinaryMatrix(self, grid:list[list[int]])->int:
q,n=[(0,0,2)],len(grid)
if grid[0][0] or grid[-1][-1]:
return -1