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\. Medium 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-directionally** connected (i.e., they are different and they share an edge or a corner). The **length of a clear path** is the number of visited cells of this path. **Example 1:**  **Input:** grid = \[\[0,1],[1,0]] **Output:** 2 **Example 2:**  **Input:** grid = \[\[0,0,0],[1,1,0],[1,1,0]] **Output:** 4 **Example 3:** **Input:** grid = \[\[1,0,0],[1,1,0],[1,1,0]] **Output:** -1 **Constraints:** * `n == grid.length` * `n == grid[i].length` * `1 <= n <= 100` * `grid[i][j] is 0 or 1`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	shortestPathBinaryMatrix(int[][] grid)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

shortestPathBinaryMatrix

public int shortestPathBinaryMatrix(int[][] grid)