【算法刷题】leetcode 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的话，就搜索其相邻的O，标记O为别的，

最后剩下的O就是被X包围的O

	void DFS(vector<vector<char>> &board, int i, int j, int col , int row)
	{
		vector<vector<int>> dir = { {0,1},{0,-1},{1,0},{-1,0} };
		board[i][j] = 'A';
		for (int k = 0; k < 4; ++k)
		{
			int x = i + dir[k][0];
			int y = j + dir[k][1];
			if (x >= 0 && x < row &&y >= 0 && y < col && board[x][y]=='O')
			{
				DFS(board, x, y, col, row);
			}
		}
	
	}

	void solve(vector<vector<char>> &board) {
		if (board.empty() || board[0].empty())
			return;

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

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

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

	}