-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquestion130.js
51 lines (51 loc) · 1.28 KB
/
question130.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/**
* @name Surrounded Regions
* @param {character[][]} board
* @return {void} Do not return anything, modify board in-place instead.
*/
const solve = function (board) {
let m = board.length;
if (m == 0) {
return;
}
let n = board[0].length;
let cannot = {};
let dfs = (i, j) => {
// 越界、标示过或者非相连O下return
if (
i < 0 ||
j < 0 ||
i == m ||
j == n ||
board[i][j] != 'O' ||
cannot[i + '-' + j]
) {
return;
}
cannot[i + '-' + j] = true;
dfs(i - 1, j);
dfs(i + 1, j);
dfs(i, j - 1);
dfs(i, j + 1);
};
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
// 从边缘O出发寻找其相连点都标示为不可替换
if (
(i == 0 || j == 0 || i == m - 1 || j == n - 1) &&
board[i][j] == 'O'
) {
dfs(i, j);
}
}
}
// 规避边界条件去循环
for (let i = 1; i < m - 1; i++) {
for (let j = 1; j < n - 1; j++) {
if (!cannot[i + '-' + j] && board[i][j] == 'O') {
board[i][j] = 'X';
}
}
}
};
solve([]);