반응형
1091. Shortest Path in Binary Matrix

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that: All the visited cells of the path are 0. All the adjacent cells of the path are 8-directi..
Algorithm/LeetCode Daily Challenge 2022. 5. 23. 10:30
반응형
1