130. 被围绕的区域(BFS、DFS)
题目
给你一个 m x n
的矩阵 board
,由若干字符 'X'
和 'O'
,找到所有被 'X'
围绕的区域,并将这些区域里所有的 '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"]]
解释:被围绕的区间不会存在于边界上,换句话说,任何边界上的 'O' 都不会被填充为 'X'。 任何不在边界上,或不与边界上的 'O' 相连的 'O' 最终都会被填充为 'X'。如果两个元素在水平或垂直方向相邻,则称它们是“相连”的。
示例2
输入:board = [["X"]]
输出:[["X"]]
提示
m == board.length
n == board[i].length
1 <= m, n <= 200
board[i][j]
为'X'
或'O'
分析
直接判断O是否被X围绕有些困难,那我们直接寻找不被X围绕的区域,标记后,遍历矩阵将O改成X,将标记改为O。遍历四个边,若有O,使用BFS或者DFS寻找联通区域并标记即可。
代码
public void solve(char[][] board) {
for(int i=0;i<board.length;i++){
if(board[i][0]=='O') full(board, i, 0);
if(board[i][board[0].length-1]=='O') full(board, i, board[0].length-1);
}
for(int i=0;i<board[0].length;i++){
if(board[0][i]=='O') full(board, 0, i);
if(board[board.length-1][i]=='O') full(board, board.length-1, i);
}
for(int i=0;i<board.length;i++){
for(int j=0;j<board[0].length;j++){
if(board[i][j]=='O') board[i][j]='X';
else if(board[i][j]=='#') board[i][j]='O';
}
}
}
public void full(char[][] board, int x, int y){
int[][] step = new int[][]{{-1,0},{0,-1},{0,1},{1,0}};
List<List<Integer>> list = new ArrayList<>();
list.add(new ArrayList<>(Arrays.asList(x, y)));
board[x][y] = '#';
while(list.size()>0){
int m = list.get(0).get(0);
int n = list.get(0).get(1);
list.remove(0);
for(int i=0;i<step.length;i++){
if(m+step[i][0]>=0 && m+step[i][0]<board.length && n+step[i][1]>=0 && n+step[i][1]<board[0].length && board[m+step[i][0]][n+step[i][1]]=='O'){
list.add(new ArrayList<>(Arrays.asList(m+step[i][0], n+step[i][1])));
board[m+step[i][0]][n+step[i][1]]='#';
}
}
}
}
结果
时间超过44.50%
内存超过76.42%