【leetcode】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

分析：类似于中国围棋的二维字符数组，将被'X'包围的'O'全部转化为'X'，不同的是，与边缘接轨的'O'不用转化为'X'，所以切入点在于边缘的‘O’，从边缘开始做DFS或者BFS，由于用例有200*200的棋盘，使用Java写DFS会因为递归太多层报Stackoverflow的错误，用C++实现DFS能够AC，用Java写的BFS也可以AC。

Java DFS 报错StackOverflow：

	public static int dic[][] = { { 1, 0 }, { 0, 1 }, { 0, -1 }, { -1, 0 } };

	public void solve(char[][] board) {
		if (board == null || board.length == 0) {
			return;
		}

		for (int i = 0; i < board.length; i++) {
			dfs(board, i, 0);
			dfs(board, i, board[0].length - 1);
		}

		for (int j = 0; j < board[0].length; j++) {
			dfs(board, 0, j);
			dfs(board, board.length - 1, j);
		}

		for (int i = 0; i < board.length; i++) {
			for (int j = 0; j < board[0].length; j++) {
				board[i][j] = board[i][j] == 'U' ? 'O' : 'X';
			}
		}
	}

	public void dfs(char[][] board, int i, int j) {
		if (i < 0 || i >= board.length || j < 0 || j >= board[0].length
				|| board[i][j] != 'O') {
			return;
		}
		board[i][j] = 'U';
		for (int k = 0; k < 4; k++) {
			dfs(board, i + dic[k][0], j + dic[k][1]);
		}
	}

C++ DFS AC代码：

class Solution {
public:
    int dic [4][2]= {{1,0},{0,1},{0,-1},{-1,0}};
    
	void solve(vector<vector<char>> &board) {
		int n = board.size();
		if (n == 0) {
			return;
		}
		int m = board[0].size();
		
		for (int i = 0; i < n; i++) {
			dfs(board, i, 0);
			dfs(board, i, m - 1);
		}

		for (int j = 0; j < m; j++) {
			dfs(board, 0, j);
			dfs(board, n - 1, j);
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				board[i][j] = board[i][j] == 'U' ? 'O' : 'X';
			}
		}
	}

	void dfs(vector<vector<char>> &board, int i, int j) {
		if(i<0 || i>= board.size() || j<0 || j>= board[0].size() || board[i][j]!='O'){
			return;
		}
		board[i][j] = 'U';
		for(int k=0;k<4;k++){
		    dfs(board, i + dic[k][0],j+dic[k][1] );
		}
	}
};

Java BFS AC代码：

	public static int dic[][] = { { 1, 0 }, { 0, 1 }, { 0, -1 }, { -1, 0 } };
	Queue<Point> q = new LinkedList<Point>();

	public void solve(char[][] board) {
		if (board == null || board.length == 0) {
			return;
		}

		for (int i = 0; i < board.length; i++) {
			if (board[i][0] == 'O') {
				board[i][0] = 'U';
				q.offer(new Point(i, 0));
			}
			if (board[i][board[0].length - 1] == 'O') {
				board[i][board[0].length - 1] = 'U';
				q.offer(new Point(i, board[0].length - 1));
			}
		}

		for (int j = 0; j < board[0].length; j++) {
			if (board[0][j] == 'O') {
				board[0][j] = 'U';
				q.offer(new Point(0, j));
			}
			if (board[board.length - 1][j] == 'O') {
				board[board.length - 1][j] = 'U';
				q.offer(new Point(board.length - 1, j));
			}
		}

		while (!q.isEmpty()) {
			Point temp = q.poll();
			for (int k = 0; k < 4; k++) {
				int x = temp.x + dic[k][0];
				int y = temp.y + dic[k][1];
				if (x >= 0 && x < board.length && y >= 0 && y < board[0].length
						&& board[x][y] == 'O') {
					board[x][y] = 'U';
					q.offer(new Point(x, y));
				}
			}
		}

		for (int i = 0; i < board.length; i++) {
			for (int j = 0; j < board[0].length; j++) {
				board[i][j] = board[i][j] == 'U' ? 'O' : 'X';
			}
		}
	}

	public class Point {
		int x;
		int y;

		Point(int x, int y) {
			this.x = x;
			this.y = y;
		}
	}