题目链接:click~
/*题意:给出一个二维数组,有'X'和'O',将被'X'包围的'O'替换为'X'*/
/**
*思路:与其求被X包围的O,不如求没有被X包围的O,先对这样的O进行标记(标记成+)
* 最后重新扫描一下数组,将遇到的O变成X,遇到的特殊标记变成O
*
*/
class Solution {
private:
int n,m;
public:
void BFS(vector<vector<char>> &board, vector<int> &dx, vector<int> &dy, int &x, int &y) {
pair<int,int> s, tmp;
queue<pair<int,int>> q;
s.first = x;
s.second = y;
board[x][y] = '+';
q.push(s);
while(!q.empty()) {
tmp = q.front();
q.pop();
for(int i = 0; i < 4; i ++) { //朝四个方向遍历
s.first = tmp.first + dx[i];
s.second = tmp.second + dy[i];
if(0 <= s.first && s.first < n && 0 <= s.second && s.second < m && board[s.first][s.second] == 'O') {
board[s.first ][s.second] = '+';
q.push(s);
}
}
}
}
void solve(vector<vector<char>> &board) {
n = board.size();
if(n == 0) return;
m = board[0].size();
if(m == 0) return;
vector<int> dx = {-1, 1, 0, 0};
vector<int> dy = {0, 0, -1, 1};
//第一列和最后一列
for(int i = 0, j1 = 0, j2 = m-1; i < n; i ++) {
if(board[i][j1] == 'O') BFS(board, dx, dy, i, j1);
if(board[i][j2] == 'O') BFS(board, dx, dy, i, j2);
}
//第一行和最后一行
for(int j = 1, i1 = 0, i2 = n-1; j < m; j ++) {
if(board[i1][j] == 'O') BFS(board, dx, dy, i1, j);
if(board[i2][j] == 'O') BFS(board, dx, dy, i2, j);
}
for(int i = 0; i < n; i ++) {
for(int j = 0; j < m; j ++) {
if(board[i][j] == 'O') board[i][j] = 'X';
if(board[i][j] == '+') board[i][j] = 'O';
}
}
}
};