130. 被围绕的区域/C++

此题与200. 岛屿的个数/C++很像。
先对边沿的O节点做dfs并做记号，然后将没做记号的O改成X。

class Solution {
    int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
    int row,col;
    
    bool inArea(int x, int y){
        return x>=0 && x<row && y>=0 && y<col;
    }
    
    void dfs(vector<vector<char>>& board,int x,int y){
        if(inArea(x,y) && board[x][y]=='O'){
            board[x][y]='-';
            for(int i=0;i<4;++i)
                dfs(board, x+d[i][0],y+d[i][1]);
        }
        return;
    }
public:
    void solve(vector<vector<char>>& board) {
        row=board.size();
        if(row==0)
            return;
        
        col=board[0].size();
        if(col==0)
            return;
        
        //沿着左右两边做dfs
        for(int i=0;i<row;++i){
            dfs(board,i,0);
            dfs(board,i,col-1);
        }
        
        //沿着上下两边做dfs
        for(int i=0;i<col;++i){
            dfs(board,0,i);
            dfs(board,row-1,i);
        }
        
		//遍历一遍，遇到O改成X，遇到-改成O
        for(int i=0;i<row;++i){
            for(int j=0;j<col;++j){
                if(board[i][j]=='O')
                    board[i][j]='X';
                if(board[i][j]=='-')
                    board[i][j]='O';    
            }
        }
        return;
    }
};