题目描述:
给定一个二维的矩阵,包含 'X'
和 'O'
(字母 O)。
找到所有被 '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
解题思路:没被包围的'O'一定直接或间接与边界上的'O'相连,所以我们只需遍历四个边界,找出与边界上的'O'相邻的'O',将其都标记为'A',最后遍历整个board,将'O'修改为'X',将'A'还原为'O'即可。
深度优先算法代码如下:
class Solution{
int n,m;
public void solve(char[][]board){
n=board.length;
if(n==0)return;
m=board[0].length;
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';//被包围的O修改成X
else if(board[i][j]=='O')
board[i][j]='X';//未被包围的O还原回来
}
}
}
public void dfs(char[][]board,int x,int y){
if(x<0||x>=n||y<0||y>=m||board[x][y]!='O')
return;//不满足条件直接返回
board[x][y]='A';
dfs(board,x-1,y);
dfs(board,x,y+1);
dfs(board,x+1,y);
dfs(board,x,y-1);
}
}
广度优先算法:
class Solution {
int[] dx = {1, -1, 0, 0};
int[] dy = {0, 0, 1, -1};
public void solve(char[][] board) {
int n = board.length;
if (n == 0) {
return;
}
int m = board[0].length;
Queue<int[]> queue = new LinkedList<int[]>();
for (int i = 0; i < n; i++) {
if (board[i][0] == 'O') {
queue.offer(new int[]{i, 0});
}
if (board[i][m - 1] == 'O') {
queue.offer(new int[]{i, m - 1});
}
}
for (int i = 1; i < m - 1; i++) {
if (board[0][i] == 'O') {
queue.offer(new int[]{0, i});
}
if (board[n - 1][i] == 'O') {
queue.offer(new int[]{n - 1, i});
}
}
while (!queue.isEmpty()) {
int[] cell = queue.poll();
int x = cell[0], y = cell[1];
board[x][y] = 'A';
for (int i = 0; i < 4; i++) {
int mx = x + dx[i], my = y + dy[i];
if (mx < 0 || my < 0 || mx >= n || my >= m || board[mx][my] != 'O') {
continue;
}
queue.offer(new int[]{mx, my});
}
}
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';
}
}
}
}
}