LeetCode 130. 被围绕的区域 深搜 每日一题

问题描述

给你一个 m x n 的矩阵 board ，由若干字符 'X' 和 'O' ，找到所有被 'X' 围绕的区域，并将这些区域里所有的 'O' 用 'X' 填充。

输入：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'

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/surrounded-regions
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

Java

class Solution {
    public void solve(char[][] board) {
        //凡是以四条边为边界的O都是不能被包围的
        //因此我们只需要深搜与四条边相邻的O就能找到不能被包围的O
        //剩下的O就是可以被包围的

        int row = board.length;
        int col = board[0].length;

        //四条边
        for(int j = 0;j < col;j++){
            dfs(board,0,j);
            dfs(board,row - 1,j);
        }
        for(int i = 0;i < row;i++){
            dfs(board,i,0);
            dfs(board,i,col - 1);
        }

        for(int i = 0;i < row;i++){
            for(int j = 0;j < col;j++){
                if(board[i][j] == 'A'){
                    board[i][j] = 'O';
                }else if(board[i][j] == 'O'){
                    board[i][j] = 'X';
                }
            }
        }

    }
    public void dfs(char[][] board,int i,int j){
        int row = board.length;
        int col = board[0].length;

        if(i < 0 || j < 0 || i >= row || j >= col || board[i][j] != 'O'){
            return;
        }

        board[i][j] = 'A';

        dfs(board,i + 1,j);
        dfs(board,i - 1,j);
        dfs(board,i,j + 1);
        dfs(board,i,j - 1);
    }
}