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

从周围的每个‘O’点开始进行BFS搜索，将所有连通的点标记为“+”，表示该点没有被封闭。然后对矩阵进行遍历，没有被标记为+的O点即为封闭的，将其标记为X，标记为+的点恢复为原来的O状态。BFS队列中存储点的坐标(i, j)。

class Solution {
public:
    void solve(vector<vector<char>> &board) {
        if(board.empty()) return;
        const int m = board.size();
        const int n = board[0].size();
        
        for(int i=0; i<m; i++)
        {
            bfs(board, i, 0);
            bfs(board, i, n-1);
        }
        for(int j=0; j<n; j++)
        {
            bfs(board, 0, j);
            bfs(board, m-1, j);
        }
        for(int i=0; i<m; i++)
        for(int j=0; j<n; j++)
        {
            if(board[i][j] == 'O')  board[i][j] = 'X';
            else if(board[i][j] == '+') board[i][j] = 'O';
        }
    }
    
    void bfs(vector<vector<char>> &board, int i, int j)
    {
        if(board[i][j] != 'O')
            return;
        pair<int, int> start = {i, j};
        queue<pair<int, int> > q;
        
        board[i][j] = '+';
        q.push(start);
        while(!q.empty())
        {
            pair<int,int> p = q.front();
            i = p.first;  //cannot be omitted
            j = p.second; //cannot be ommited
            q.pop();
            
            if(i-1>=0 && board[i-1][j] == 'O')
            {
                board[i-1][j] = '+';
                q.push(make_pair(i-1, j));
            }
            if(j-1>=0 && board[i][j-1] == 'O')
            {
                board[i][j-1] = '+';
                q.push(make_pair(i, j-1));
            }
            if(i+1<board.size() && board[i+1][j] == 'O')
            {
                board[i+1][j] = '+';
                q.push(make_pair(i+1, j));
            }
            if(j+1<board[0].size() && board[i][j+1] == 'O')
            {
                board[i][j+1] = '+';
                q.push(make_pair(i, j+1));
            }
        }
    }
};