LeetCode 130. 被围绕的区域
原题链接
简单
作者:
我是java同学
,
2023-08-08 16:00:15
,
所有人可见
,
阅读 80
class Solution {
public:
int n, m;
vector<vector<char>> g;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
void solve(vector<vector<char>>& board) {
g = board;
n = g.size();
m = g[0].size();
for (int i = 0; i < n; i ++ )
for (int j = 0; j < m; j ++ )
if (!i || !j || i == n - 1 || j == m - 1)
if (g[i][j] == 'O')
dfs(i, j);
for (int i = 0; i < n; i ++ )
for (int j = 0; j < m; j ++ )
if (g[i][j] == '#') g[i][j] = 'O';
else g[i][j] = 'X';
board = g;
}
void dfs(int x, int y) {
g[x][y] = '#';
for (int i = 0; i < 4; i ++ ) {
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m && g[a][b] == 'O')
dfs(a, b);
}
}
};