add 1926

fishercoder1534 · fishercoder1534 · commit 334127fef05d · 2021-07-10T09:12:42.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag        1           
 |-----|----------------|---------------|--------|-------------|-------------
+|1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) ||Medium|DP, DFS, BFS|
 |1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) ||Easy|Array, Greedy|
 |1920|[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) ||Easy||
 |1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) ||Easy|Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_1926.java b/src/main/java/com/fishercoder/solutions/_1926.java
@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class _1926 {
+    public static class Solution1 {
+        public int nearestExit(char[][] maze, int[] entrance) {
+            int m = maze.length;
+            int n = maze[0].length;
+            int[] directions = new int[]{0, 1, 0, -1, 0};
+            Queue<int[]> queue = new LinkedList<>();
+            queue.offer(new int[]{entrance[0], entrance[1], 0});
+            boolean[][] visited = new boolean[m][n];
+            visited[entrance[0]][entrance[1]] = true;
+            int shortestSteps = m * n;
+            while (!queue.isEmpty()) {
+                int[] curr = queue.poll();
+                for (int i = 0; i < directions.length - 1; i++) {
+                    int nextX = curr[0] + directions[i];
+                    int nextY = curr[1] + directions[i + 1];
+                    if (nextX >= 0 && nextX < m && nextY >= 0 && nextY < n && maze[nextX][nextY] == '.' && !visited[nextX][nextY]) {
+                        visited[nextX][nextY] = true;
+                        if (nextX == 0 || nextX == m - 1 || nextY == 0 || nextY == n - 1) {
+                            shortestSteps = Math.min(shortestSteps, curr[2] + 1);
+                        } else {
+                            queue.offer(new int[]{nextX, nextY, curr[2] + 1});
+                        }
+                    }
+                }
+            }
+            return shortestSteps == m * n ? -1 : shortestSteps;
+        }
+    }
+}
