Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
77 lines (74 loc) · 2.25 KB

File metadata and controls

77 lines (74 loc) · 2.25 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//http://blog.csdn.net/worldwindjp/article/details/19251995
//if current is already a ".", we don't need to search it anymore
class Pair {
int x;
int y;
Pair (int x, int y) {
this.x = x;
this.y = y;
}
}
public class Solution {
public void solve(char[][] board) {
int rows = board.length;
if (rows == 0) {
return;
}
int cols = board[0].length;
for (int i = 0; i < cols; i++) {
if (board[0][i] == 'O') {
this.doBFS(0, i, board);
}
if (board[rows-1][i] == 'O') {
this.doBFS(rows-1, i, board);
}
}
for (int i = 1; i < rows - 1; i++) {
if (board[i][0] == 'O') {
this.doBFS(i, 0, board);
}
if (board[i][cols-1] == 'O') {
this.doBFS(i, cols-1, board);
}
}
this.generateResult(board);
}
public void generateResult(char[][] board) {
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[0].length; j++) {
if (board[i][j] == 'O') {
board[i][j] = 'X';
}
if (board[i][j] == '.') {
board[i][j] = 'O';
}
}
}
}
public void doBFS (int i, int j, char[][] board) {
Queue<Pair> queue = new LinkedList<Pair>();
Pair curr = new Pair(i, j);
queue.add(curr);
while (queue.isEmpty() == false) {
Pair temp = queue.poll();
int row = temp.x;
int col = temp.y;
if (board[row][col] == '.') {
continue;
}
board[row][col] = '.';
if (row - 1 >= 0 && board[row-1][col] == 'O') {
queue.add(new Pair(row-1, col));
}
if (row + 1 < board.length && board[row+1][col] == 'O') {
queue.add(new Pair(row+1, col));
}
if (col - 1 >= 0 && board[row][col-1] == 'O') {
queue.add(new Pair(row, col-1));
}
if (col + 1 < board[0].length && board[row][col+1] == 'O') {
queue.add(new Pair(row, col+1));
}
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.