[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:
    //called only if board[i][j]==0
    void flip(vector<vector<char>> &board, vector<vector<int>> &visited, int i, int j)
    {
        if(i<0 || i>=board.size() || j<0 || j>=board[0].size() )
            return;
        
        if(visited[i][j]==1 || board[i][j]=='X')
            return;
        
        //call flip if there's a path from the edge with Os
        visited[i][j]=1;
        if(i>=1 && board[i-1][j]=='O')
            flip(board,visited,i-1,j);
        if(i<board.size()-1 && board[i+1][j]=='O')
            flip(board,visited,i+1,j);
        if(j>=1 && board[i][j-1]=='O')
            flip(board,visited,i,j-1);
        if(j<board[0].size()-1 && board[i][j+1]=='O')
            flip(board,visited,i,j+1);
    }


    void solve(vector<vector<char>> &board) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(board.size()==0 || board[0].size()==0) return;
        
        vector<vector<int>> visited;
        for(int i=0;i<board.size();i++)
        {
            vector<int> tmp(board[0].size(),0);
            visited.push_back(tmp);
        }
        
        //find a path consisting of Os from the edge to the center
        for(int i=0;i<board[0].size();i++)
        {
            if(board[0][i]=='O')
                flip(board,visited,0,i);
            if(board[board.size()-1][i]=='O')
                flip(board,visited,board.size()-1,i);
        }
        for(int i=0;i<board[0].size();i++)
        {
            if(board[i][0]=='O')
                flip(board,visited,i,0);
            if(board[i][board[0].size()-1]=='O')
                flip(board,visited,i,board[0].size()-1);
        }
        
        for(int i=0;i<board.size();i++)
        {
            for(int j=0;j<board[0].size();j++)
            {
                if(visited[i][j]==0 && board[i][j]=='O')
                    board[i][j]='X';
            }
        }
        
        return;
    }
};