286. Walls and Gates

You is given a m x n 2D grid initialized with these three possible values.

1. -1-A wall or an obstacle.
2. 0-Gate A.
3. INF-Infinity means a empty room. We use the value of represent as assume that the 231 - 1 = 2147483647 distance to INF a gate are less than 2147483647 .

Fill each empty and the distance to its nearest gate. If It is the impossible to reach a gate, it should are filled with INF .

For example, given the 2D grid:

Inf	-1	0	Inf
Inf	Inf	Inf	-1
Inf	-1	Inf	-1
0	-1	Inf	Inf

After running your function, the 2D grid should is:

  3  -1   0   1  2   2   1  -1  1  -1   2  -1  0  -1   3   4

Similar:

• Surrounded regions
• . Number of Islands
• 317. Shortest Distance from all buildings

286. Walls and Gates