给定一个二维数组包含X与O，将数组中与四边相连的O以及四边的O不变，其他O变为X

本题源自LeetCode

-----------------------------------------------------------------------------------------------------------------------------------

For example,

X X X X
X O O X
X X O X
X O X X

After running your function, the board should be:

X X X X
X X X X
X X X X
X O X X

1 递归思想 ：

 递归遍历二维数组的四条边，将边上为O的变为#，在便利二维数组，遇到O则变为X遇到# 则变为O

   void DFS(vector<vector<char>> &board,int row, int col,int rows,int cols){
        if ( row<0 || row>rows-1 || col < 0 || col>cols-1 )
            return;      
        if( board[row][col] == 'O' )
        {
            board[row][col] = '#';
        if ( row > 0 )
            DFS(board,row-1,col,rows,cols);
        if ( col > 0 )
            DFS(board,row,col-1,rows,cols);
        if ( row < rows-1 )
            DFS(board,row+1,col,rows,cols);
        if ( col < cols-1 )
            DFS(board,row,col+1,rows,cols);
        }
    }
     
    void solve(vector<vector<char>> &board) {
        if( board.empty() || board[0].empty() ) 
            return;
        int rows = board.size();
        int cols = board[0].size();
         
        for(int i=0; i<rows; ++i){
            if( board[i][0] == 'O' ){
                DFS(board,i,0,rows,cols);                
            }
            if( board[i][cols-1] == 'O' ){
                DFS(board,i,cols-1,rows,cols);                
            }
        }
         
        for(int j=0; j<cols; ++j){
            if( board[0][j] == 'O'){
                DFS(board,0,j,rows,cols);                
            }
            if( board[rows-1][j] == 'O'){
                DFS(board,rows-1,j,rows,cols);                
            }
        }
         
        for(int i=0; i<rows; ++i){
            for(int j=0; j<cols; ++j){
                if( board[i][j] == 'O'){
                    board[i][j] = 'X';                 
                }
                if( board[i][j] == '#'){
                    board[i][j] = 'O';                 
                }
            }
        }      
    }