深度遍历解决被围绕的区域

深度遍历 

class Solution {
    private int m;
    private int n;
    public void dfs(int i, int j, char[][] board){
        if(i < 0 || i >= m || j < 0 || j >= n || board[i][j] == '#' || board[i][j] == 'X'){
            return;
        }
        // if(board[i][j] == '#' || board[i][j] == 'X'){
        //     return;
        // }
        board[i][j] = '#';
        dfs(i - 1, j, board);
        dfs(i + 1, j, board);
        dfs(i, j - 1, board);
        dfs(i, j + 1, board);

    }
    public void solve(char[][] board) {
        if(board.length == 0){
            return;
        }
        m = board.length;
        n = board[0].length;
        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) && board[i][j] == 'O'){
                    dfs(i, j, board);

                }
            }
        }

       for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
               if(board[i][j] == 'O'){
                    board[i][j] = 'X';
                }
                if(board[i][j] == '#'){
                  board[i][j] = 'O';
                }

            }
        }

        

    }
}