add 1091 java

Author: yennanliu

README.md

@@ -939,6 +939,7 @@
 967|[Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences/)| [Python](./leetcode_python/Breadth-First-Search/numbers-with-same-consecutive-differences.py) | _O(2^n)_ | _O(2^n)_ | Medium |`good trick` | AGAIN** (3)
 675|[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/)| [Python](./leetcode_python/Breadth-First-Search/cut-off-trees-for-golf-event.py), [Java](./leetcode_java/Breadth-First-Search/cut-off-trees-for-golf-event.java) ||| Hard |tree, BFS, complex, `amazon` | AGAIN (not start)
 864|[Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/)| [Python](./leetcode_python/Breadth-First-Search/shortest-path-to-get-all-keys.py) ||| Hard |BFS, `amazon` | AGAIN (not start)
+1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/description/)| [Java](./leetcode_java/src/main/java/LeetCodeJava/BFS/ShortestPathInBinaryMatrix.java) ||| Medium |BFS, `google` | AGAIN (not start)
 994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)| [Python](./leetcode_python/Breadth-First-Search/rotting-oranges.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/BFS/RottingOranges.java) ||| Medium |BFS, dp `amazon` | OK** (2)
 1110|[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/editorial/)| [Python](./leetcode_python/Breadth-First-Search/delete_nodes_and_return_forest.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/BFS/DeleteNodesAndReturnForest.java) ||| Medium |BFS, recursive `google` | not start
 1162| [As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) | [Python](./leetcode_python/Breadth-First-Search/as-far-from-land-as-possible.py) | | | Medium | dfs, bfs, good basic, `amazon`| AGAIN**** (3)

data/progress.txt

@@ -1,4 +1,4 @@
-20250105: 399
+20250105: 399,1091
 20250104: 1031,369
 20250101: 729,731
 20241231: 769,817,855(again)

data/to_review.txt

@@ -1,4 +1,4 @@
-2025-03-01 -> ['399']
+2025-03-01 -> ['399,1091']
 2025-02-28 -> ['1031,369']
 2025-02-25 -> ['729,731']
 2025-02-24 -> ['769,817,855(again)']
@@ -8,34 +8,34 @@
 2025-02-15 -> ['369,311']
 2025-02-14 -> ['370']
 2025-02-13 -> ['815,871,593,1109']
-2025-02-08 -> ['399']
+2025-02-08 -> ['399,1091']
 2025-02-07 -> ['1031,369', '560,523']
 2025-02-04 -> ['729,731']
 2025-02-03 -> ['769,817,855(again)']
 2025-02-01 -> ['498(again),934', '304,853,325']
 2025-01-31 -> ['379,173']
 2025-01-30 -> ['079,212(todo),362,849']
-2025-01-26 -> ['399', '370(todo)']
+2025-01-26 -> ['399,1091', '370(todo)']
 2025-01-25 -> ['1031,369', '369,311']
 2025-01-24 -> ['370', '34,767']
 2025-01-23 -> ['815,871,593,1109']
 2025-01-22 -> ['729,731']
 2025-01-21 -> ['769,817,855(again)']
 2025-01-20 -> ['722,380']
 2025-01-19 -> ['498(again),934', '33,81']
-2025-01-18 -> ['399', '379,173']
+2025-01-18 -> ['399,1091', '379,173']
 2025-01-17 -> ['1031,369', '079,212(todo),362,849', '560,523', '253']
 2025-01-16 -> ['776,31']
 2025-01-15 -> ['004(todo),34(todo),162(todo),275(todo)']
 2025-01-14 -> ['729,731', '986(todo),1229(todo),1868(todo),80(todo),209(todo),283(todo),360(todo),713(todo),532(todo),611(todo)']
-2025-01-13 -> ['399', '769,817,855(again)']
+2025-01-13 -> ['399,1091', '769,817,855(again)']
 2025-01-12 -> ['1031,369', '369,311']
 2025-01-11 -> ['498(again),934', '370', '304,853,325', '394']
-2025-01-10 -> ['399', '379,173', '815,871,593,1109', '833,950']
+2025-01-10 -> ['399,1091', '379,173', '815,871,593,1109', '833,950']
 2025-01-09 -> ['1031,369', '729,731', '079,212(todo),362,849']
-2025-01-08 -> ['399', '769,817,855(again)']
-2025-01-07 -> ['399', '1031,369']
-2025-01-06 -> ['399', '1031,369', '729,731', '498(again),934']
+2025-01-08 -> ['399,1091', '769,817,855(again)']
+2025-01-07 -> ['399,1091', '1031,369']
+2025-01-06 -> ['399,1091', '1031,369', '729,731', '498(again),934']
 2025-01-05 -> ['1031,369', '769,817,855(again)', '379,173', '370(todo)']
 2025-01-04 -> ['729,731', '079,212(todo),362,849', '369,311', '560,523', '53,210,207']
 2025-01-03 -> ['729,731', '769,817,855(again)', '498(again),934', '370', '34,767', '444']

leetcode_java/src/main/java/LeetCodeJava/BFS/ShortestPathInBinaryMatrix.java

@@ -0,0 +1,54 @@
+package LeetCodeJava.BFS;
+
+// https://leetcode.com/problems/shortest-path-in-binary-matrix/description/
+/**
+ * 1091. Shortest Path in Binary Matrix
+ * Medium
+ * Topics
+ * Companies
+ * Hint
+ * 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
+ *
+ */
+public class ShortestPathInBinaryMatrix {
+
+    // V0
+//    public int shortestPathBinaryMatrix(int[][] grid) {
+//
+//    }
+
+    // V1
+    
+    // V2
+}