Leetcode 286 Walls and Gates

最新推荐文章于 2021-01-22 05:49:00 发布

Nahida_nora

最新推荐文章于 2021-01-22 05:49:00 发布

阅读量104

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/weixin_43876597/article/details/104943969

版权

Leetcode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

Leetcode 286 Walls and Gates

It’s smart to enqueue all the 0s at the same time, rather than empty the queue of one 0 and enqueue the next. So whenever an empty room is reached, it must be from the closest gate.

private static final int EMPTY = Integer.MAX_VALUE;
private static final int GATE = 0;
private static final List<int[]> DIRECTIONS = Arrays.asList(
        new int[] { 1,  0},
        new int[] {-1,  0},
        new int[] { 0,  1},
        new int[] { 0, -1}
);

public void wallsAndGates(int[][] rooms) {
    int m = rooms.length;
    if (m == 0) return;
    int n = rooms[0].length;
    Queue<int[]> q = new LinkedList<>();
    for (int row = 0; row < m; row++) {
        for (int col = 0; col < n; col++) {
            if (rooms[row][col] == GATE) {
                q.add(new int[] { row, col });
            }
        }
    }
    while (!q.isEmpty()) {
        int[] point = q.poll();
        int row = point[0];
        int col = point[1];
        for (int[] direction : DIRECTIONS) {
            int r = row + direction[0];
            int c = col + direction[1];
            if (r < 0 || c < 0 || r >= m || c >= n || rooms[r][c] != EMPTY) {
                continue;
            }
            rooms[r][c] = rooms[row][col] + 1;
            q.add(new int[] { r, c });
        }
    }
}