leetcode Walls and Gates

背景

You are given a m x n 2D grid initialized with these three possible values.

• -1 - A wall or an obstacle.

• 0 - A gate.

• INF - Infinity means an empty room. We use the value 231 - 1 = 2147483647 to represent INF as you may assume that the distance to a gate is less than 2147483647.

Fill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be filled with INF.

For example, given the 2D grid:

INF  -1  0  INF
INF INF INF  -1
INF  -1 INF  -1
0    -1 INF INF

After running your function, the 2D grid should be:

3  -1   0   1
2   2   1  -1
1  -1   2  -1
0  -1   3   4

分析

最短路径问题，BFS。 首先遍历找出所有的门，然后将其offer进队列。

public void wallsAndGates(int[][] rooms) {
        int rows = rooms.length;
        if (rows == 0) {
            return;
        }
        int cols = rooms[0].length;

        Queue<int[]> queue = new LinkedList<>();
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (rooms[i][j] == 0) {
                    queue.offer(new int[]{i, j});
                }
            }
        }

        int[][] directs = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
        while (!queue.isEmpty()) {
            int[] coords = queue.poll();

            for (int i = 0; i < directs.length; i++) {
                int x = coords[0] + directs[i][0];
                int y = coords[1] + directs[i][1];

                if (x >= 0 && x < rows && y >= 0 && y < cols && rooms[x][y] == Integer.MAX_VALUE) {
                    rooms[x][y] = rooms[coords[0]][coords[1]] + 1;
                    queue.offer(new int[]{x, y});
                }
            }
        }
    }

转载于:https://my.oschina.net/mythss/blog/3012685