286. Walls and Gates

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

1. -1 - A wall or an obstacle.
2. 0 - A gate.
3. 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来做，把所有的‘0’的坐标加进queue，进行广度遍历。代码如下：

public class Solution {
    public void wallsAndGates(int[][] rooms) {
        if (rooms == null || rooms.length == 0) {
            return;
        }
        int m = rooms.length, n = rooms[0].length;
        Queue<int[]> queue = new LinkedList<int[]>();
        for (int i = 0; i < m; i ++) {
            for (int j = 0; j < n; j ++) {
                if (rooms[i][j] == 0) {
                    queue.offer(new int[]{i, j});
                }
            }
        }
        int[][] dirs = new int[][]{{1,0},{-1,0},{0,1},{0,-1}};
        while (!queue.isEmpty()) {
            int point[] = queue.poll();
            if (rooms[point[0]][point[1]] == 0) {
                for (int[] dir: dirs) {
                    int newRow = point[0] + dir[0];
                    int newCol = point[1] + dir[1];
                    if (newRow >=0 && newRow < m && newCol >= 0 && newCol < n && rooms[newRow][newCol] == 2147483647) {
                        queue.offer(new int[]{newRow, newCol});
                    }
                }
            }else if (rooms[point[0]][point[1]] == 2147483647) {
                int min = 2147483647;
                for (int[] dir: dirs) {
                    int newRow = point[0] + dir[0];
                    int newCol = point[1] + dir[1];
                    if (newRow >=0 && newRow < m && newCol >= 0 && newCol < n && rooms[newRow][newCol] != -1) {
                        min = Math.min(min, rooms[newRow][newCol]);
                        if (rooms[newRow][newCol] == 2147483647) {
                            queue.offer(new int[]{newRow, newCol});
                        }
                    }
                }
                rooms[point[0]][point[1]] = min + 1;
            }
        }
    }
}

也可以用DFS来做。返回条件是if(i < 0 || i >= rooms.length || j < 0 || j >= rooms[0].length || rooms[i][j] < d) return。代码如下：

public class Solution {
    public void wallsAndGates(int[][] rooms) {
        for(int i = 0; i < rooms.length; i++) {
            for(int j = 0; j < rooms[0].length; j++) {
                if(rooms[i][j] == 0) {
                    dfs(rooms, i, j, 0);
                }
            }
        }
    }
    
    public void dfs(int[][] rooms, int i, int j, int d) {
        if(i < 0 || i >= rooms.length || j < 0 || j >= rooms[0].length || rooms[i][j] < d) return;
        rooms[i][j] = d;
        dfs(rooms, i - 1, j, d + 1);
        dfs(rooms, i + 1, j, d + 1);
        dfs(rooms, i, j - 1, d + 1);
        dfs(rooms, i, j + 1, d + 1);
    }
}