130. 被圍繞的區域

原題鏈接：130. 被圍繞的區域

 

solution:

        dfs

class Solution {
public:
    void solve(vector<vector<char>>& board) {
        int m = board.size(),n = board[0].size();
        for(int i = 0;i < m;i++) {
            dfs(board, i, 0);
            dfs(board, i, n - 1);
        }

        for(int j = 0;j < n;j++) {
            dfs(board, 0, j);
            dfs(board, m - 1, j);
        }

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


    //從外邊界dfs，將每一個可以延伸的O變為#,在進行m*n遍曆,將剩餘的O變為X
    void dfs(vector<vector<char>> &board, int x,int y) {
        if(x < 0 || x == board.size() || y < 0 || y == board[0].size() || board[x][y] != 'O') return;
        board[x][y] = '#';
        dfs(board, x + 1, y);
        dfs(board, x, y + 1);
        dfs(board, x - 1, y);
        dfs(board, x, y - 1);
    }
};