# Walls and Gates

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

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

Fill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be 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 be:

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

public void wallsAndGates(int[][] rooms) {
if(rooms == null || rooms.length == 0 || rooms[0].length == 0) return;
int row = rooms.length;
int col = rooms[0].length;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
if(rooms[i][j] == 0){
dfs(rooms, i, j+1, 1);
dfs(rooms, i+1, j, 1);
dfs(rooms, i-1, j, 1);
dfs(rooms, i, j-1, 1);
}
}
}
}

private void dfs(int[][] rooms, int i, int j, int curValue){
if(i<0 || j<0 || i>=rooms.length || j>=rooms[0].length) return;
if(rooms[i][j] == -1) return;
if(rooms[i][j]>curValue){
rooms[i][j] = curValue;
dfs(rooms, i+1, j, curValue+1);
dfs(rooms, i, j+1, curValue+1);
dfs(rooms, i-1, j, curValue+1);
dfs(rooms, i, j-1, curValue+1);
}
}

• 本文已收录于以下专栏：

## [Leetcode 286]: Walls and Gates

Walls and Gates Total Accepted: 411 Total Submissions: 1365 Difficulty: Medium You are giv...

## 286. Walls and Gates

You are given a m x n 2D grid initialized with these three possible values. -1 - A wall or an obs...
• zshouyi
• 2017年06月15日 01:53
• 96

## [leetcode 286] Walls and Gates---各个点到门的距离

Question: You are given a m x n 2D grid initialized with these three possible values. -1 - A...

## LeetCode 286. Walls and Gates（墙与门）

• jmspan
• 2016年04月15日 01:10
• 446

## Richard Feynman and Bill Gates ---An imaginary encounter

• 2008年08月20日 12:27
• 69KB
• 下载

## codeforces 525 D Arthur and Walls

codeforces 525 D Arthur and Walls 题意： 给出一个n*m的表格，里面有'*'和'.'，求把最少的'*'移除掉，使得'.'所在的连通块是矩形。 限制： 1 ...
• whai362
• 2015年04月02日 10:51
• 464

## Codeforces Round #297 (Div. 2) -- D. Arthur and Walls （判断矩形）

D. Arthur and Walls time limit per test 2 seconds memory limit per test 512 megabytes ...

## codeforces 471D MUH and Cube Walls kmp

举报原因： 您举报文章：Walls and Gates 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)