包围区域问题

题目

分析

被包围的区域一定没有与边界相连的O，因此可以利用深度优先遍历矩阵的四个边，把边上的O及其相连的O替换成其他字符，如*，然后再遍历矩阵把剩余的O替换成X,*替换成O。

public class Solution {
    public void solve(char[][] board) {
        if(board.length == 0) {
            return;
        }
        boolean[][] visited = new boolean[board.length][board[0].length];
        for(int i = 0; i < board[0].length; i++) {
            dfs(board,0,i,visited);
            dfs(board,board.length-1,i,visited);
        }
        for(int i = 0; i < board.length; i++) {
            dfs(board,i,0,visited);
            dfs(board,i,board[0].length-1,visited);
        }
        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 dfs(char[][] board,int row,int col,boolean[][] visited) {
        if(row < 0 || row >= board.length) {
            return;
        }
        if(col < 0 || col >= board[0].length) {
            return;
        }
        if(board[row][col] == 'X' || visited[row][col]) {
            return;
        }
        //访问当前节点
        board[row][col] = '*';
        visited[row][col] = true;
        dfs(board,row,col-1,visited);
        dfs(board,row-1,col,visited);
        dfs(board,row,col+1,visited);
        dfs(board,row+1,col,visited);
    }
}