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
No.1
Input:
1 | [[0,0,0], |
Output:
1 | [[0,0,0], |
No.2
Input:
1 | [[0,0,0], |
Output:
1 | [[0,0,0], |
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.
BFS
1 | public int[][] updateMatrix(int[][] matrix) { |
Other
1 | public int[][] updateMatrix(int[][] matrix) { |