[Leetcode 106] 130 Surrounded Regions

Problem:

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

 

Analysis:

This is the first BFS problem I solved, congratuations! The basic idea is that we can search every position neighbouring a 'O'. If until reach the 'X' or the boundry of the board. If we reach the boundry, then implies these connected 'O's is not surrounded by 'X's. For other 'O's, we then change them to 'X'.

Carefully thinking about the process, many efforts are wasted, postions may be accessed multiple times. To reduce the workload, we can simply search the boundry, if a 'O' is encounted, we then conduct BFS. And we know that all the 'O's searched in this wat, should be 'O' and other remaining 'O's should be changed into 'X'.

 

Code:

class Solution {
public:
    int row, col;

    void solve(vector<vector<char>> &board) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (board.size() == 0)
            return ;
        
        row = board.size();
        col = board[0].size();
        
        for (int i=0; i<col; i++) {
            if (board[0][i] == 'O') {
                board[0][i] = 0;
                bfs(board, 0, i);
            }
            
            if (board[row-1][i] == 'O') {
                board[row-1][i] = 0;
                bfs(board, row-1, i);
            }
        }
        
        for (int i=0; i<row; i++) {
            if (board[i][0] == 'O') {
                board[i][0] = 0;
                bfs(board, i, 0);
            }
            
            if (board[i][col-1] == 'O') {
                board[i][col-1] = 0;
                bfs(board, i, col-1);
            }
        }
        
        for (int i=0; i<row; i++)
            for (int j=0; j<col; j++)
                if (board[i][j] == 'O')
                    board[i][j] = 'X';
                else if (board[i][j] == 0)
                    board[i][j] = 'O';
    }
    
private:
    void bfs(vector<vector<char>> &board, int r, int c) {
        int dirR[4] = {-1, 0, 1, 0};
        int dirC[4] = {0, 1, 0, -1};
        queue<int> q;
        
        q.push(r*row+c);
        
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int i=0; i<4; i++) {
                int rr = v / row + dirR[i];
                int cc = v % row + dirC[i];
                if (isValid(rr, cc) && board[rr][cc] == 'O') {
                    board[rr][cc] = 0;
                    q.push(rr*row + cc);
                }
            }
        }
    }
    
    bool isValid(int r, int c) {
        return (r>=0 && r<row) && (c>=0 && c<col);
    }
};