# 1091. Shortest Path in Binary Matrix

![](https://4272748102-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LekNH5IywF8mjBxFcnu%2F-MeNmUsTJasgvRG_dU3g%2F-MeO-SMfqjr0TDV53JNP%2Fimage.png?alt=media\&token=80fd4536-48c1-4306-aa38-1106726f2ca8)

![](https://4272748102-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LekNH5IywF8mjBxFcnu%2F-MeNmUsTJasgvRG_dU3g%2F-MeO-XrRrgPgJ-pusCv7%2Fimage.png?alt=media\&token=ee94a74a-3697-4e91-8f36-cbdfdfd92feb)

![](https://4272748102-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LekNH5IywF8mjBxFcnu%2F-MeNmUsTJasgvRG_dU3g%2F-MeO-aajdLwgoerXc8zE%2Fimage.png?alt=media\&token=96fb7bea-51fd-411e-8e1b-32b6c70caf33)

##

##

## A\*

<https://leetcode.com/problems/shortest-path-in-binary-matrix/discuss/313347/A*-search-in-Python>

time: O(nlogn)

space: O(n)

之後回來寫

## pure BFS

time: O(n^2)

space: O(n^2)

```java
class Solution {
    // 8 directions
    private static final int[][] DIRECTIONS = {{0,1}, {1, 0}, {-1, 0}, {0,-1}, {1,1}, {-1,-1}, {-1,1}, {1,-1}};
    public int shortestPathBinaryMatrix(int[][] grid) {
        // 8 directions
        // contrait: == 0 & !vistited
        // when reach m - 1, n-1 return level
        // notice the edge case grid[0][0] == 1 || grid[n-1][n-1] == 1 should return -1
        
        if (grid == null || grid.length == 0) return -1;
        int n = grid.length;
        if(grid[0][0] == 1 || grid[n-1][n-1] == 1) return -1; // edge case
        
        boolean visited[][] = new boolean[n][n];
        Queue<int[]> queue = new LinkedList<>();
        queue.offer(new int[]{0, 0});
        visited[0][0] = true;
        
        int level = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int q = 0; q < size; q++) {
                int cell[] = queue.poll();
                if (cell[0] == n - 1 && cell[1] == n - 1) { // reach bottom-right
                    return level + 1;
                }
                for (int dir[] : DIRECTIONS) {
                    int x = cell[0] + dir[0];
                    int y = cell[1] + dir[1];
                    // All the visited cells of the path are 0
                    if (x >= 0 && x < n && y >= 0 && y < n && !visited[x][y] && grid[x][y] == 0) {
                        queue.offer(new int[]{x, y});
                        visited[x][y] = true;
                    }
                }
            }
            level++;
        }
        
        return -1;
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://timmybeeflin.gitbook.io/cracking-leetcode/dfs-and-bfs/bfs/1091.-shortest-path-in-binary-matrix.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.