给你一个 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"]]
提示:
m == board.length
n == board[i].length
1 <= m, n <= 200
board[i][j]
为'X'
或'O'
自创AC代码
class Solution {
public:
void solve(vector<vector<char>>& board) { //主代码
wen(board);
ci(board);
int m=board.size();
int n=board[0].size();
for(int i=0;i<m;i++) //把标记A改回去
for(int j=0;j<n;j++){
if(board[i][j]=='A') board[i][j]='O';
}
}
void wen(vector<vector<char>>& board){ //处理边缘
int m=board.size();
int n=board[0].size();
for(int i=0;i<m;i++)
for(int j=0;j<n;j++){
if(i==0||i==m-1||j==0||j==n-1)
dfsb(i,j,board);
}
}
void dfsb(int a,int b,vector<vector<char>>& board){ //边缘延申的O先标记成A
if(panduanb(a,b,board)) return;
if(board[a][b]=='O'){
board[a][b]='A';
dfsb(a,b-1,board);
dfsb(a,b+1,board);
dfsb(a+1,b,board);
dfsb(a-1,b,board);
}
}
int panduanb(int a,int b,vector<vector<char>>& board){ //对边缘情况的判断
int m = board.size();
int n = board[0].size();
if(a<0||b<0||a>=m||b>=n) return 1; //不合格
else if(board[a][b]=='X') return 1;
else return 0;
}
void ci(vector<vector<char>>& board){ //第二轮处理全部的O
int m=board.size();
int n=board[0].size();
for(int i=0;i<m;i++)
for(int j=0;j<n;j++){
dfs(i,j,board);
}
}
void dfs(int a,int b,vector<vector<char>>& board){ //遇到O就继续延申
if(panduan(a,b,board)) return;
if(board[a][b]=='O'){
board[a][b]='X';
dfs(a,b-1,board);
dfs(a,b+1,board);
dfs(a+1,b,board);
dfs(a-1,b,board);
}
}
int panduan(int a,int b,vector<vector<char>>& board){ //对于第二次处理的判断
int m = board.size();
int n = board[0].size();
if(a<0||b<0||a>=m||b>=n) return 1; //不合格
else if(board[a][b]=='X'||board[a][b]=='X') return 1;
else return 0;
}
};
官方题解
class Solution {
public:
int n, m;
void dfs(vector<vector<char>>& board, int x, int y) {
if (x < 0 || x >= n || y < 0 || y >= m || board[x][y] != 'O') {
return; //对于边缘的X直接跳过
}
board[x][y] = 'A';
dfs(board, x + 1, y);
dfs(board, x - 1, y);
dfs(board, x, y + 1);
dfs(board, x, y - 1);
}
void solve(vector<vector<char>>& board) {
n = board.size();
if (n == 0) {
return;
}
m = board[0].size();
// 先判断边缘
for (int i = 0; i < n; i++) {
dfs(board, i, 0);
dfs(board, i, m - 1);
}
for (int i = 1; i < m - 1; i++) {
dfs(board, 0, i);
dfs(board, n - 1, i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (board[i][j] == 'A') {
board[i][j] = 'O';
} else if (board[i][j] == 'O') {
board[i][j] = 'X';
}
}
}
}
};
有点乱