LeetCode -- 130. 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.

---

二、翻译

给定一个元素为 X 和 O 的二维面板，获取所有被 X 包围的区域。

通过将该周围区域中的所有 O 都转变为 X 来获取所求区域。

解释：

周边区域不会出现在边界上，这意味着所有出现在边界上的 O 都不会被转变为 X。任何不在边界上且没有和一个在边界上的 O 相连通的 O 将会被转变为 X。如果它们是水平或垂直连接的相邻单元，则连接两个单元。

---

三、分析

翻译渣渣，常用谷歌翻译 T_T。

题目大意就是找出没有和边界上的 O 相连通的 O，然后将其变为 X。（相连通就是有一条通路）

既然如此，只要遍历四个边界，即第一行、最后一行、第一列和最后一列即可，然后判断当前是否是 O，是的就用 DFS 递归就行，注意递归结束的条件（这题的条件很简单，反正我经常对条件理不清），递归时注意是四个方向的，因为题目中说了垂直水平，但是要注意判断边界的问题。

递归时，对符合条件的点进行适当的处理。

1. 代码1是一开始想到的，开辟一个相同大小的二维数组，0表示该点是需要变为 X 的，1 表示该点不需要变化，保持原样即可；
2. 代码2是后面修改的，直接在原二维数组中进行相应的标记，后面进行变换。

---

四、AC代码

4.1. 代码1

class Solution {
public:

	void dfs(vector<vector<char>>& board, int r, int c, vector<vector<int>>& marked)
	{
		if (marked[r][c] == 1 || board[r][c] == 'X' || r <= 0 || r >= board.size() - 1 || c <= 0 || c >= board[0].size() - 1) {
			return;
		}
		marked[r][c] = 1;
		dfs(board, r - 1, c, marked);
		dfs(board, r, c + 1, marked);
		dfs(board, r + 1, c, marked);
		dfs(board, r, c - 1, marked);
	}

	void solve(vector<vector<char>>& board) {
		if (board.size() == 0 || board.size() == 1) {
			return;
		}

		vector<vector<int>> marked(board.size(), vector<int>(board[0].size(), 0));

		for (int i = 0; i < board[0].size(); ++i) {
			if (board[0][i] == 'O') {
				marked[0][i] = 1;
				dfs(board, 1, i, marked);
			}
		}

		for (int i = 0; i < board[0].size(); ++i) {
			if (board[board.size() - 1][i] == 'O') {
				marked[board.size() - 1][i] = 1;
				dfs(board, board.size() - 2, i, marked);
			}
		}

		for (int i = 1; i < board.size() - 1; ++i) {
			if (board[i][0] == 'O') {
				marked[i][0] = 1;
				dfs(board, i, 1, marked);
			}
		}

		for (int i = 1; i < board.size() - 1; ++i) {	
			if (board[i][board[0].size() - 1] == 'O') {
				marked[i][board[0].size() - 1] = 1;
				dfs(board, i, board[0].size() - 2, marked);
			}
		}

		for (int i = 0; i < board.size(); ++i) {
			for (int j = 0; j < board[0].size(); ++j) {
				if (marked[i][j] == 0 && board[i][j] == 'O') {
					board[i][j] = 'X';
				}
			}
		}
	}
};

---

4.2. 代码2

class Solution {
public:

	void dfs(vector<vector<char>>& board, int r, int c) {
		if (board[r][c] == 'X' || board[r][c] == 'Y') {
			return;
		}
		board[r][c] = 'Y';
		if (r > 1) {
			dfs(board, r - 1, c);
		}
		// 此处 board[0].size() - 2 和下面的 board.size() - 2
		// 应该改为 r + 2 < board.size()
		// size()函数返回的是 size_t 类型，一个 unsigned int
		if (c + 2 < board[0].size()) {
			dfs(board, r, c + 1);
		}
		if (r + 2 < board.size()) {
			dfs(board, r + 1, c);
		}
		if (c > 1) {
			dfs(board, r, c - 1);
		}
	}

	void solve(vector<vector<char>>& board) {
		if (board.empty()) {
			return;
		}

		int row = board.size();
		int col = board[0].size();

		for (int i = 0; i < row; ++i) {
			if (board[i][0] == 'O') {
				dfs(board, i, 0);
			}
			if (board[i][col - 1] == 'O') {
				dfs(board, i, col - 1);
			}
		}

		for (int i = 1; i < col - 1; ++i) {
			if (board[0][i] == 'O') {
				dfs(board, 0, i);
			}
			if (board[row - 1][i] == 'O') {
				dfs(board, row - 1, i);
			}
		}

		for (int i = 0; i < row; ++i) {
			for (int j = 0; j < col; ++j) {
				if (board[i][j] == 'O') {
					board[i][j] = 'X';
				} else if (board[i][j] == 'Y') {
					board[i][j] = 'O';
				}
			}
		}
	}
};

---

如有错误之处，敬请指出！大家共勉！