[LeetCode.542]01 Matrix

问题描述
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.

The distance between two adjacent cells is 1.

---

Example 1:
Input:

0 0 0
0 1 0
0 0 0

Output:
0 0 0
0 1 0
0 0 0

---

Example 2:
Input:

0 0 0
0 1 0
1 1 1

Output:
0 0 0
0 1 0
1 2 1

代码实现

public class OneZeroMatrix542 {
    public class Solution {
        public List<List<Integer>> updateMatrix(List<List<Integer>> matrix) {
            int m = matrix.size();
            int n = matrix.get(0).size();

            Queue<int[]> queue = new LinkedList<>();//队列存下所有为0的坐标
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix.get(i).get(j) == 0) {
                        queue.offer(new int[] {i, j});
                    }
                    else {
                        matrix.get(i).set(j, Integer.MAX_VALUE);
                    }
                }
            }

            int[][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

            while (!queue.isEmpty()) {//从0的坐标向外做bfs
                int[] cell = queue.poll();
                for (int[] d : dirs) {
                    int r = cell[0] + d[0];
                    int c = cell[1] + d[1];
                    if (r < 0 || r >= m || c < 0 || c >= n ||
                            matrix.get(r).get(c) <= matrix.get(cell[0]).get(cell[1]) + 1) continue;
                    queue.add(new int[] {r, c});
                    matrix.get(r).set(c, matrix.get(cell[0]).get(cell[1]) + 1);
                }
            }

            return matrix;
        }
    }
}