Surrounded Region

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或者DFS向里面扩展，visited记录connect点，最后如果没有被visited到的O，会变成X；T: O(m*n), Space: O(m*n).

class Solution {
    public void solve(char[][] board) {
        int m = board.length;
        int n = board[0].length;
        boolean[][] visited = new boolean[m][n];
        Queue<int[]> queue = new LinkedList<>();
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(i == 0 || i == m - 1 || j == 0 || j == n - 1) {
                    if(board[i][j] == 'O') {
                        queue.offer(new int[]{i, j});
                        visited[i][j] = true;
                    }
                }
            }
        }
        
        int[][] dirs = new int[][]{{0,1},{0,-1},{-1,0},{1,0}};
        while(!queue.isEmpty()) {
            int[] node = queue.poll();
            for(int[] dir: dirs) {
                int nx = node[0] + dir[0];
                int ny = node[1] + dir[1];
                if(0 <= nx && nx < m && 0 <= ny && ny < n 
                   && !visited[nx][ny] && board[nx][ny] == 'O') {
                    queue.offer(new int[]{nx, ny});
                    visited[nx][ny] = true;
                }
            }
        }
        
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(board[i][j] == 'O' && !visited[i][j]) {
                    board[i][j] = 'X';
                }
            }    
        }
    }
}

class Solution {
    public void solve(char[][] board) {
        int m = board.length;
        int n = board[0].length;
        boolean[][] visited = new boolean[m][n];
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(i == 0 || i == m - 1 || j == 0 || j == n - 1) {
                    if(board[i][j] == 'O') {
                        dfs(board, visited, i, j);
                    }
                }
            }
        }
        
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(board[i][j] == 'O' && !visited[i][j]) {
                    board[i][j] = 'X';
                }
            }    
        }
    }
    
    int[][] dirs = new int[][] {{0,1},{0,-1},{-1,0},{1,0}};
    private void dfs(char[][] board, boolean[][] visited, int x, int y) {
        if(x < 0 || x >= board.length || y < 0 || y >= board[0].length || visited[x][y]) {
            return;
        }
        if(board[x][y] == 'O') {
            visited[x][y] = true;
            for(int[] dir: dirs) {
                int nx = x + dir[0];
                int ny = y + dir[1];
                dfs(board, visited, nx, ny);
            }
        }
    }
}