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

 

Note:

1. The number of elements of the given matrix will not exceed 10,000.
2. There are at least one 0 in the given matrix.
3. The cells are adjacent in only four directions: up, down, left and right.

DFS求解，矩阵中值为1的位置，如果周围有0，则该值保持不变，如果该值周围没有0，说明该位置的值需要调整。

程序如下所示：

class Solution {
    public int[][] updateMatrix(int[][] matrix) {
        for (int i = 0; i < matrix.length; ++ i){
            for (int j = 0; j < matrix[0].length ;++ j){
                if (matrix[i][j] == 1 && !hasNeiberZero(i, j, matrix)){
                    matrix[i][j] = 100;
                }
            }
        }
        for (int i = 0; i < matrix.length; ++ i){
            for (int j = 0; j < matrix[0].length; ++ j){
                if (matrix[i][j] != 0){
                    dfs(matrix, i, j, -1);
                }
            }
        }
        return matrix;
    }
    
    public void dfs(int[][] matrix, int i, int j, int val){
        if (i < 0 || i >= matrix.length || j < 0 || j >= matrix[0].length){
            return;
        }
        if (matrix[i][j] <= val){
            return;
        }
        if (val > 0){
            matrix[i][j] = val;
        }
        dfs(matrix, i - 1, j, matrix[i][j] + 1);
        dfs(matrix, i, j - 1, matrix[i][j] + 1);
        dfs(matrix, i, j + 1, matrix[i][j] + 1);
        dfs(matrix, i + 1, j, matrix[i][j] + 1);
    }
    
    private boolean hasNeiberZero(int x, int y, int[][] matrix){
        if (x > 0&&matrix[x-1][y] == 0) {
            return true;
        }
        if (x < matrix.length-1&&matrix[x+1][y]==0) {
            return true;
        }
        if (y > 0&&matrix[x][y-1] == 0) {
            return true;
        }
        if (y < matrix[0].length-1&&matrix[x][y+1] == 0) {
            return true;    
        }
        return false;
    }
}