Given a 2D board containing 'X'
and 'O'
, capture all regions surrounded by 'X'
.
A region is captured by flipping all 'O'
s into 'X'
s in that surrounded region.
For example,
X X X X
X O O X
X X O X
X O X X
After running your function, the board should be:
X X X X
X X X X
X X X X
X O X X
Solution:
Code:
<span style="font-size:14px;">class Solution {
public:
void solve(vector<vector<char>> &board) {
const int rows = board.size();
if (rows == 0) return;
const int cols = board[0].size();
if (cols == 0) return;
queue<pair<int, int> > q;
for (int i = 0; i < rows; ++i) {
if (board[i][0] == 'O') {
board[i][0] = 'Y';
q.push(make_pair(i, 0));
}
if (board[i][cols-1] == 'O') {
board[i][cols-1] = 'Y';
q.push(make_pair(i, cols-1));
}
}
for (int j = 0; j < cols; ++j) {
if (board[0][j] == 'O') {
board[0][j] = 'Y';
q.push(make_pair(0, j));
}
if (board[rows-1][j] == 'O') {
board[rows-1][j] = 'Y';
q.push(make_pair(rows-1, j));
}
}
pair<int, int> p;
while (!q.empty()) {
p = q.front();
q.pop();
if (p.first > 0 && board[p.first-1][p.second] == 'O') {
board[p.first-1][p.second] = 'Y';
q.push(make_pair(p.first-1, p.second));
}
if (p.first < rows-1 && board[p.first+1][p.second] == 'O') {
board[p.first+1][p.second] = 'Y';
q.push(make_pair(p.first+1, p.second));
}
if (p.second > 0 && board[p.first][p.second-1] == 'O') {
board[p.first][p.second-1] = 'Y';
q.push(make_pair(p.first, p.second-1));
}
if (p.second < cols-1 && board[p.first][p.second+1] == 'O') {
board[p.first][p.second+1] = 'Y';
q.push(make_pair(p.first, p.second+1));
}
}
for (int i = 0; i < rows; ++i)
for (int j = 0; j < cols; ++j)
if (board[i][j] == 'O')
board[i][j] = 'X';
else if (board[i][j] == 'Y')
board[i][j] = 'O';
}
};</span>