LeetCode-542. 01 Matrix (JAVA)零一矩阵

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.

参考：http://blog.csdn.net/u014688145/article/details/64126559

解决思路

1. 对待求矩阵进行一次变换，遇0元素不变，遇1元素设为最大值。
   
   00inf