Surrounded Regions

很有意思画面感的一道题，但是bfs不太会，注意linkedlist做queue的用法，不是pop 而是poll， 为啥想想得

    public void solve(char[][] board) {
        // 挺有意思一道题，讲解 和code http://www.cnblogs.com/huntfor/p/3898068.html
        
        // XXXXX  --> XXXXX  --> XXXX
        // XOXOX      X#XOX      XOXX
        // XOXOX      X#XOX      XOXX
        // XOXXX      X#XXX      XOXX
        
        if(board==null || board.length<=1 || board[0].length<=1) return;
        
        for(int i=0;i<board[0].length; i++){
            bfs(board, 0, i);
            bfs(board, board.length-1, i);
        }
        for(int j=0;j<board.length; j++){
            bfs(board, j, 0);
            bfs(board, j, 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]=='O') {
                    board[i][j]='X';
                }else if(board[i][j]=='#') 
                    board[i][j]='O';
            }
        }
    }
    
    public void bfs(char[][] bd,int i,int j){
        if(bd[i][j]!='O') return;
        bd[i][j] = '#';
        int code = i*bd[0].length +j;
        LinkedList<Integer> q = new LinkedList<Integer>();
        q.add(code);
        
        while(!q.isEmpty()){
            code = q.poll(); // linkedlist.poll() Retrieves and removes the head (first element) of this list.
            int r = code/bd[0].length;
            int c = code%bd[0].length;
            
            //up
            if(r>0 && bd[r-1][c] =='O'){
                q.add((r-1)*bd[0].length +c);
                bd[r-1][c] = '#';
            }
            //down
            if(r<bd.length-1 && bd[r+1][c] =='O'){
                q.add((r+1)*bd[0].length +c);
                bd[r+1][c] = '#';
            }
            //left
            if(c>0 && bd[r][c-1] =='O'){
                q.add((r)*bd[0].length +c-1);
                bd[r][c-1] = '#';
            }
            //right
            if(c<bd[0].length-1 && bd[r][c+1] =='O'){
                q.add((r)*bd[0].length +c+1);
                bd[r][c+1] = '#';
            }
        }
        
    }