【Leetcode】1926. Nearest Exit from Entrance in Maze

题目地址：

https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/

给定一个$m\times n$的网格，.代表空地，+代表障碍物，再给定起点，问从起点出发，每一步可以上下左右走一格，走到出口至少需要多少步。出口指的是在边界的非障碍物的位置。

直接BFS即可。代码如下：

import java.util.LinkedList;
import java.util.Queue;

public class Solution {
    public int nearestExit(char[][] maze, int[] entrance) {
        Queue<int[]> q = new LinkedList<>();
        q.offer(entrance);
        boolean[][] vis = new boolean[maze.length][maze[0].length];
        vis[entrance[0]][entrance[1]] = true;
        int[] d = {-1, 0, 1, 0, -1};
        int res = 0;
        while (!q.isEmpty()) {
            res++;
            for (int i = q.size() - 1; i >= 0; i--) {
                int[] cur = q.poll();
                for (int j = 0; j < 4; j++) {
                    int nextX = cur[0] + d[j], nextY = cur[1] + d[j + 1];
                    if (0 <= nextX && nextX < maze.length && 0 <= nextY && nextY < maze[0].length && maze[nextX][nextY] != '+' && !vis[nextX][nextY]) {
                        if (check(nextX, nextY, maze)) {
                            return res;
                        }
                        
                        vis[nextX][nextY] = true;
                        q.offer(new int[]{nextX, nextY});
                    }
                }
            }
        }
        
        return -1;
    }
    
    private boolean check(int x, int y, char[][] maze) {
        return x == 0 || x == maze.length - 1 || y == 0 || y == maze[0].length - 1;
    }
}

时空复杂度$O(mn)$。