130 Surrounded Regions

题目链接：https://leetcode.com/problems/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 是在矩形最外圈，它肯定不会被 X 包围，与它相连（邻）的 O 也就不可能被 X 包围，也就不会被替换，所以我们的工作主要是找出：
1. 最外圈的 O
2. 与最外圈的 O 相连的 O
3. 将上述找到的元素替换为某种标识符，代码中使用“#”
4. 最后按先行后列的顺序遍历矩形，找到没有被替换为 O 的元素，它们就是被 X 完全包围的需要被替换为 X 的元素；同时，标记为 # 的元素是没有被 X 包围的元素，此时将它们变回原来的 O

上述思路参考了大神的解法。
大神参考链接：http://blog.csdn.net/linhuanmars/article/details/22904855

代码实现：

public class Solution {
    public void solve(char[][] board) {
        if(board == null || board.length == 0 || board[0].length == 0)
            return;
        for(int i = 0; i < board[0].length; i ++) {
            fill(board, 0, i);
            fill(board, board.length - 1, i);
        }
        for(int i = 0; i < board.length; i ++) {
            fill(board, i, 0);
            fill(board, i, board[0].length - 1);
        }
        for(int i = 0; i < board.length; i ++) {
            for(int j = 0; j < board[0].length; j ++) {
                if(board[i][j] == '#')
                    board[i][j] = 'O';
                else if(board[i][j] == 'O')
                    board[i][j] = 'X';
            }
        }
    }
    void fill(char[][] board, int i, int j) {
        if(board[i][j] != 'O')
            return;
        board[i][j] = '#';
        LinkedList<Integer> queue = new LinkedList();
        int index = i * board[0].length + j;
        queue.offer(index);
        while(!queue.isEmpty()) {
            index = queue.poll();
            int row = index / board[0].length;
            int col = index % board[0].length;
            if(row - 1 >= 0 && board[row - 1][col] == 'O') {
                board[row - 1][col] = '#';
                queue.offer((row - 1) * board[0].length + col);
            }
            if(row + 1 < board.length && board[row + 1][col] == 'O') {
                board[row + 1][col] = '#';
                queue.offer((row + 1) * board[0].length + col);
            }
            if(col - 1 >= 0 && board[row][col - 1] == 'O') {
                board[row][col - 1] = '#';
                queue.offer(row * board[0].length + (col - 1));
            }
            if(col + 1 < board[0].length && board[row][col + 1] == 'O') {
                board[row][col + 1] = '#';
                queue.offer(row * board[0].length + (col + 1));
            }
        }
    }
}

58 / 58 test cases passed.
Status: Accepted
Runtime: 9 ms