一、题目
二、题解
正难则反,将边缘的O先修改为.然后再整体遍历将中心O修改X,将.修改为O
class Solution {
public:
int n, m, dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
void dfs(int i, int j, vector<vector<char>>& g) {
g[i][j] = '.';
for (int k = 0; k < 4; k++)
if (i + dx[k] >= 0 && i + dx[k] < n && j + dy[k] >= 0 && j + dy[k] < m && g[i + dx[k]][j + dy[k]] == 'O')
dfs(i + dx[k], j + dy[k], g);
}
void solve(vector<vector<char>>& board) {
n = board.size(), m = board[0].size();
for (int i = 0; i < n; i++) {
if (board[i][0] == 'O') dfs(i, 0, board);
if (board[i][m - 1] == 'O') dfs(i, m - 1, board);
}
for (int j = 0; j < m; j++) {
if (board[0][j] == 'O') dfs(0, j, board);
if (board[n - 1][j] == 'O') dfs(n - 1, j, board);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (board[i][j] == 'O')
board[i][j] = 'X';
else if (board[i][j] == '.')
board[i][j] = 'O';
}
};