-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path130.js
More file actions
85 lines (71 loc) · 2 KB
/
130.js
File metadata and controls
85 lines (71 loc) · 2 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/**
* @param {character[][]} board
* @return {void} Do not return anything, modify board in-place instead.
*/
var solve = function(board) {
if (board.length === 0) return;
if (board[0].length === 0) return;
const rowNum = board.length;
const colNum = board[0].length;
const map = {};
function markAsTracked(i, j) {
map[i * colNum + j] = true;
}
function isTracked(i, j) {
return map[i * colNum + j];
}
findRelatedNodesAndMarkAsTracked = (i, j) => {
if (board[i][j] === "X") return;
if (isTracked(i, j)) return;
markAsTracked(i, j);
let list = [[i, j]];
while(list.length > 0) {
let current = list.shift();
const [i, j] = current;
// left one
if (j !== 0 && board[i][j - 1] !== "X" && !isTracked(i, j - 1)) {
markAsTracked(i, j - 1);
list.push([i, j - 1]);
}
// right one
if (j !== colNum - 1 && board[i][j + 1] !== "X" && !isTracked(i, j + 1)) {
markAsTracked(i, j + 1);
list.push([i, j + 1]);
}
// up one
if (i !== 0 && board[i - 1][j] !== "X" && !isTracked(i - 1, j)) {
markAsTracked(i - 1, j);
list.push([i - 1, j]);
}
// down one
if (i !== rowNum - 1 && board[i + 1][j] !== "X" && !isTracked(i + 1, j)) {
markAsTracked(i + 1, j);
list.push([i + 1, j]);
}
}
}
// top line
for (let j = 0; j < colNum; ++j) {
findRelatedNodesAndMarkAsTracked(0, j);
}
// bottom line
for (let j = 0; j < colNum; ++j) {
findRelatedNodesAndMarkAsTracked(rowNum - 1, j);
}
// left most column
for (let i = 0; i < rowNum; ++i) {
findRelatedNodesAndMarkAsTracked(i, 0);
}
// right most column
for (let i = 0; i < rowNum; ++i) {
findRelatedNodesAndMarkAsTracked(i, colNum - 1);
}
for (let i = 0; i < rowNum; ++i) {
for (let j = 0; j < colNum; ++j) {
if (board[i][j] !== "X" && !isTracked(i, j)) {
board[i][j] = "X";
}
}
}
};
solve([["O","X","O"],["X","O","X"],["O","X","O"]]);