From 7ef34a8249234a524d0ebfc0d7c35beff5b9e182 Mon Sep 17 00:00:00 2001
From: Leah Jia <yuwenj3@uw.edu>
Date: Fri, 12 May 2023 16:41:06 -0700
Subject: [PATCH] Create: 1091-shortest-path-in-binary-matrix.java

---
 java/1091-shortest-path-in-binary-matrix.java | 35 +++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 java/1091-shortest-path-in-binary-matrix.java

diff --git a/java/1091-shortest-path-in-binary-matrix.java b/java/1091-shortest-path-in-binary-matrix.java
new file mode 100644
index 000000000..951865f03
--- /dev/null
+++ b/java/1091-shortest-path-in-binary-matrix.java
@@ -0,0 +1,35 @@
+class Solution {
+  public int shortestPathBinaryMatrix(int[][] grid) {
+    int n = grid.length;
+    Queue<Integer[]> q = new LinkedList<>();
+    q.add(new Integer[]{0, 0, 1}); // row, col, length
+    
+    boolean[][] visited = new boolean[n][n];
+    visited[0][0] = true;
+    
+    int[][] direct = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};
+
+    while (!q.isEmpty()) {
+      Integer[] curr = q.poll();
+      int r = curr[0];
+      int c = curr[1];
+      int length = curr[2];
+      
+      // out of bounds or no way further
+      if (Math.min(r, c) < 0 || Math.max(r, c) == n || grid[r][c] == 1) continue;
+      
+      if (r == n - 1 && c == n - 1) return length;
+      
+      for (int[] d : direct) {
+        int newRow = r + d[0];
+        int newCol = c + d[1];
+        if (Math.min(newRow, newCol) >= 0 && Math.max(newRow, newCol) < n && !visited[newRow][newCol]) {
+          q.add(new Integer[]{newRow, newCol, 1 + length});
+          visited[newRow][newCol] = true;
+        }
+      }
+    }
+    return -1;
+  }
+  
+}