-1
我无法让我的代码适用于此问题,我不知道如何找出原因。它适用于小集合,但在大集合失败。包围区域不适用于较大的输入
给定一个包含'X'和'O'的2D板,捕获所有被'X'包围的区域。
通过将所有'O'翻转到包围区域中的'X'来捕获区域。
例如,
X X X X
X O O X
X X O X
X O X X
运行的功能后,主板应该是:
X X X X
X X X X
X X X X
X O X X
我的解决办法:
class Solution {
public:
void solve(vector<vector<char>> &board) {
int row = board.size();
if (row<=1) return;
int col = board[0].size();
if (col<=1) return;
for (int c=0; c<col; c=c+col-1)
for (int r=0; r<row; r++)
{
if (board[r][c]=='O')
findBdCoords(board,r, c, row, col);
}
for (int r=0; r<row; r=r+row-1)
for (int c=0; c<col; c++)
{
if (board[r][c]=='O')
findBdCoords(board,r, c, row, col);
}
for (int r=0; r<row; r++)
for (int c=0; c<col; c++)
{
if (board[r][c]=='O')
board[r][c]='x';
if (board[r][c]=='B')
board[r][c]='O';
}
}
void findBdCoords(vector<vector<char>> &board, int r, int c, int row, int col)
{
if (board[r][c]!='B')
board[r][c]='B';
//4 directions neighbor
//4 directions neighbor
if (r + 1 < row && board[r + 1][c]=='O')
findBdCoords(board, r + 1, c, row, col);
if (r - 1 >= 0&& board[r - 1][c]=='O')
findBdCoords(board, r - 1, c, row, col);
if (c + 1<col&& board[r][c + 1]=='O')
findBdCoords(board, r, c + 1, row, col);
if (c - 1 >= 0&& board[r][c - 1]=='O')
findBdCoords(board, r, c - 1, row, col);
}
};