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]]
Note:
- The number of elements of the given matrix will not exceed 10,000.
- There are at least one 0 in the given matrix.
- The cells are adjacent in only four directions: up, down, left and right.
class Solution {
public int[][] updateMatrix(int[][] matrix) {
if (matrix == null || matrix.length == 0) return matrix;
int rowNum = matrix.length;
int colNum = matrix[0].length;
Queue<int[]> queue = new LinkedList();
for (int i = 0; i < rowNum; i++) {
for (int j = 0; j < colNum; j++) {
if (matrix[i][j] == 0) {
queue.offer(new int[]{i,j});
} else {
matrix[i][j] = Integer.MAX_VALUE;
}
}
}
int[][] directions = {{1,0}, {-1,0}, {0,1}, {0,-1}};
while (!queue.isEmpty()) {
int[] point = queue.poll();
int row = point[0];
int col = point[1];
for (int[] direc : directions) {
int r = row + direc[0];
int c = col + direc[1];
if (r < 0 || r > rowNum-1 || c < 0 || c > colNum-1 || matrix[r][c] != Integer.MAX_VALUE)
continue;
matrix[r][c] = matrix[row][col] + 1;
queue.offer(new int[]{r,c});
}
}
return matrix;
}
}