Package g1001_1100.s1091_shortest_path_in_binary_matrix

Class Solution

java.lang.Object
g1001_1100.s1091_shortest_path_in_binary_matrix.Solution
public class Solution extends Object
1091 - Shortest Path in Binary Matrix.<p>Medium</p> <p>Given an <code>n x n</code> binary matrix <code>grid</code>, return <em>the length of the shortest <strong>clear path</strong> in the matrix</em>. If there is no clear path, return <code>-1</code>.</p> <p>A <strong>clear path</strong> in a binary matrix is a path from the <strong>top-left</strong> cell (i.e., <code>(0, 0)</code>) to the <strong>bottom-right</strong> cell (i.e., <code>(n - 1, n - 1)</code>) such that:</p> <ul> <li>All the visited cells of the path are <code>0</code>.</li> <li>All the adjacent cells of the path are <strong>8-directionally</strong> connected (i.e., they are different and they share an edge or a corner).</li> </ul> <p>The <strong>length of a clear path</strong> is the number of visited cells of this path.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/18/example1_1.png" alt="" /></p> <p><strong>Input:</strong> grid = [[0,1],[1,0]]</p> <p><strong>Output:</strong> 2</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/18/example2_1.png" alt="" /></p> <p><strong>Input:</strong> grid = [[0,0,0],[1,1,0],[1,1,0]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> grid = [[1,0,0],[1,1,0],[1,1,0]]</p> <p><strong>Output:</strong> -1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= n <= 100</code></li> <li><code>grid[i][j] is 0 or 1</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • shortestPathBinaryMatrix

      public int shortestPathBinaryMatrix(int[][] grid)