LeetCode - Surrounded Regions

Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.

A region is captured by flipping all 'O's into 'X's in that surrounded region.

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
Explanation:

Surrounded regions shouldn’t be on the border, which means that any 'O' on the border of the board are not flipped to 'X'. Any 'O' that is not on the border and it is not connected to an 'O' on the border will be flipped to 'X'. Two cells are connected if they are adjacent cells connected horizontally or vertically.

class Solution {
    public void solve(char[][] board) {
        if (board == null || board.length == 0 || board[0].length == 0) {
            return;
        }
        int xLength = board.length;
        int yLength = board[0].length;
        
        for (int i = 0; i < xLength; i++) {
            for (int j = 0; j< yLength; j++) {
                if (board[i][j] == 'O' && (i == 0 || j == 0 || i == xLength - 1 || j == yLength - 1)) {
                    Queue<int[]> queue = new LinkedList<>();
                     board[i][j] = 'A';
                    queue.add(new int[]{i, j});
                    while (!queue.isEmpty()) {
                        int[] curIndex = queue.poll();
                        int curX = curIndex[0];
                        int curY = curIndex[1];
                        //check up
                        if (curX > 0 && board[curX-1][curY] == 'O') {
                            board[curX-1][curY] = 'A';
                            queue.add(new int[]{curX-1, curY});
                        }
                        //check bottom
                        if (curX < xLength -1 && board[curX+1][curY] == 'O' ) {
                            board[curX+1][curY] = 'A';
                            queue.add(new int[]{curX+1, curY});
                        }
                        //check left
                        if (curY > 0 && board[curX][curY-1] == 'O') {
                            board[curX][curY-1] = 'A';
                            queue.add(new int[]{curX, curY-1});
                        }
                        //check right
                        if (curY < yLength - 1 && board[curX][curY+1] == 'O') {
                            board[curX][curY+1] = 'A';
                            queue.add(new int[]{curX, curY+1});
                        }
                    }
                }
            }
        }
        
        for (int i = 0; i < xLength; i++) {
            for (int j = 0; j < yLength; j ++) {
                if (board[i][j] == 'O') {
                    board[i][j] = 'X';
                } else if (board[i][j] == 'A') {
                    board[i][j] = 'O';
                }
            }
        }
    }
}

标签：queue,int,Surrounded,curX,curY,Regions,board,new,LeetCode
来源： https://www.cnblogs.com/incrediblechangshuo/p/14380504.html