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

思路 ： 1 . Using BFS to do this question. 2. Add edges into the queue, because the edge can't be surrounded.  3. Poll the element and mark the not surround 'O' as 'Q'
4. Change the 'Q' to 'O'

易错点 ：  Queue 里面 只有 poll() 和 remove(),  没有 pop().  还有 计算边界时候 是 四边，  i == 0 || i == m - 1 || j == 0 || j == n - 1

public class Solution {
    public void solve(char[][] board) {
        if(board.length < 1)
            return;
        Queue<Integer> qx = new LinkedList<Integer>();
        Queue<Integer> qy = new LinkedList<Integer>();
        int m = board.length;
        int n = board[0].length;
        for(int i = 0; i < m; i++){//Add the edge into the queue
            for(int j = 0; j < n; j++){
                if(board[i][j] == 'O' && (i == 0 || i == m - 1 || j == 0 || j == n - 1)){
                    qx.add(i);
                    qy.add(j);
                }
            }
        }
        
        while(!qx.isEmpty()){//Poll the element and mark the not surround 'O' as 'Q'
            int x = qx.poll();
            int y = qy.poll();
            board[x][y] = 'Q';
            if (x > 0 && board[x - 1][y] == 'O') {
				qx.add(x - 1);
				qy.add(y);
			}
			if (x < m - 1 && board[x + 1][y] == 'O') {
				qx.add(x + 1);
				qy.add(y);
			}
			if (y > 0 && board[x][y - 1] == 'O') {
				qx.add(x);
				qy.add(y - 1);
			}
			if (y < n - 1 && board[x][y + 1] == 'O') {
				qx.add(x);qy.add(y + 1);
			}
        }
        
        for(int i = 0; i < m; i++){// Change the 'Q' to 'O'
            for(int j = 0; j < n; j++){
                if(board[i][j] == 'Q'){
                    board[i][j] = 'O';
                }else{
                    board[i][j] = 'X';
                }
            }
        }
    }
}