链接:http://leetcode.com/onlinejudge#question_130
原题:
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
思路:
就是扫描一下边界的点,如果有O,那么就从这一点开始做bfs搜索就行了。
源码:
class Solution {
public:
void solve(vector<vector<char>> &board) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (board.size() == 0 || board[0].size() == 0)
return;
rows = board.size();
cols = board[0].size();
for (int j=0; j<cols; j++) {
if (board[0][j] == 'O')
bfs(0, j, board);
if (board[rows-1][j] == 'O')
bfs(rows-1, j, board);
}
for (int i=1; i<rows-1; i++) {
if (board[i][0] == 'O')
bfs(i, 0, board);
if (board[i][cols-1] == 'O')
bfs(i, cols-1, board);
}
for (int i=0; i<rows; i++)
for (int j=0; j<cols; j++)
if (board[i][j] == 'U')
board[i][j] = 'O';
else if (board[i][j] == 'O')
board[i][j] = 'X';
}
private:
void bfs(int x, int y,
vector<vector<char> > &board) {
queue<pair<int, int> > q;
q.push(pair<int, int>(x, y));
board[x][y] = 'U';
const int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
while (!q.empty()) {
pair<int, int> cur = q.front();
q.pop();
for (int i=0; i<4; i++) {
int curX = cur.first + dir[i][0];
int curY = cur.second + dir[i][1];
if (curX>=0 && curX<rows && curY>=0 && curY<cols) {
if (board[curX][curY] == 'O') {
board[curX][curY] = 'U';
q.push(pair<int, int>(curX, curY));
}
}
}
}
}
int rows;
int cols;
};