leetcode---surrounded-regions

Given a 2D board containing’X’and’O’, capture all regions surrounded by’X’.
A region is captured by flipping all’O’s into’X’s in that surrounded region .
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

class Solution {
public:
    void dfs(vector<vector<char>> &board, int i, int j, int dx[], int dy[], int row, int col)
    {
        board[i][j] = '#';

        for(int k=0; k<4; k++)
        {
            int r = i + dx[k];
            int c = j + dy[k];
            if(r >= 0 && r<row && c >= 0 && c < col && board[r][c] == 'O')
                dfs(board, r, c, dx, dy, row, col);
        }
    }

    void solve(vector<vector<char>> &board) 
    {
        int dx[] = {1, -1, 0, 0};
        int dy[] = {0, 0, 1, -1};
        int row = board.size();
        if(row == 0)
            return;
        int col = board[0].size();
        for(int i=0; i<row; i++)
        {
            if(board[i][0] == 'O')
                dfs(board, i, 0, dx, dy, row, col);
            if(board[i][col-1] == 'O')
                dfs(board, i, col-1, dx, dy, row, col);
        }
        for(int j=0; j<col; j++)
        {
            if(board[0][j] == 'O')
                dfs(board, 0, j, dx, dy, row, col);
            if(board[row-1][j] == 'O')
                dfs(board, row-1, j, dx, dy, row, col);
        }

        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';
            }
        }
    }
};