给你一个 m x n 的矩阵 board ,由若干字符 'X' 和 'O' 组成,捕获 所有 被围绕的区域:
连接:一个单元格与水平或垂直方向上相邻的单元格连接。
区域:连接所有 'O' 的单元格来形成一个区域。
围绕:如果您可以用 'X' 单元格 连接这个区域,并且区域中没有任何单元格位于 board 边缘,则该区域被 'X' 单元格围绕。
通过将输入矩阵 board 中的所有 'O' 替换为 'X' 来 捕获被围绕的区域。
示例 1:
输入:board = [["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"]]
解释:
在上图中,底部的区域没有被捕获,因为它在 board 的边缘并且不能被围绕。
示例 2:
输入:board = [["X"]]
输出:[["X"]]
class Solution {
public:
void solve(vector<vector<char>>& board) {
if (board.empty() || board[0].empty()) return;
int rows = board.size();
int cols = board[0].size();
// 标记边界上的'O'及其相连的'O'
for (int i = 0; i < rows; ++i) {
dfs(board, i, 0);
dfs(board, i, cols - 1);
}
for (int j = 1; j < cols - 1; ++j) {
dfs(board, 0, j);
dfs(board, rows - 1, j);
}
// 将未被标记的'O'替换为'X',已标记的恢复为'O'
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] == '#') {
board[i][j] = 'O';
}
}
}
}
private:
static constexpr int dx[4] = {0, 0, 1, -1};
static constexpr int dy[4] = {1, -1, 0, 0};
void dfs(vector<vector<char>>& board, int x, int y) {
if (x < 0 || x >= board.size() || y < 0 || y >= board[0].size() || board[x][y] != 'O') {
return;
}
// 标记已访问过的'O'
board[x][y] = '#';
// 探索四个方向
for (int i = 0; i < 4; ++i) {
dfs(board, x + dx[i], y + dy[i]);
}
}
};
本体感悟:
1,算法流程:
从边界开始dfs与'O'相邻的'O',这些点都是为被包围的点,标记一下。
从头遍历整张表,如果没被标记就变成'X',如果标记了就回复成'O'
dfs算法比较好理解,访问过的就标记一下