LeetCode-130-被围绕的区域

1、DFS

我们可以使用深度优先遍历来查找当前节点附近的节点从而判断是否被包围。考虑到我们需要找出被围绕的区域，因此我们只需要在矩阵的四条边上找出对应O延申产生的区域令其保持为O，而剩余区域则可以全部赋值为X。为了区分两种不同的O，我们可以先将最终保持为O的区域修改为R。最终我们从四条边上的O节点开始进行深度有点遍历，将遍历到的节点赋值为R。最终我们只需要再遍历一次矩阵，将所有R修改为O，所有O修改为X即可。

class Solution {
public:
    void DFS(vector<vector<char>> &board, int row, int col) {
        if (row < 0 || row > board.size() - 1 || col < 0 || col > board[0].size() - 1 || board[row][col] != 'O') {
            return;
        }
        board[row][col] = 'R';
        DFS(board, row - 1, col);
        DFS(board, row + 1, col);
        DFS(board, row, col - 1);
        DFS(board, row, col + 1);
    }

    void solve(vector<vector<char>> &board) {
        int m = board.size(), n = board[0].size();
        vector<pair<int, int>> pos;
        for (int i = 0; i < m; ++i) {
            if (board[i][0] == 'O') {
                DFS(board, i, 0);
            }
            if (board[i][n - 1] == 'O') {
                DFS(board, i, n - 1);
            }
        }
        for (int i = 1; i < n - 1; ++i) {
            if (board[0][i] == 'O') {
                DFS(board, 0, i);
            }
            if (board[m - 1][i] == 'O') {
                DFS(board, m - 1, i);
            }
        }
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (board[i][j] == 'R') {
                    board[i][j] = 'O';
                } else if (board[i][j] == 'O') {
                    board[i][j] = 'X';
                }
            }
        }
    }
};

2、BFS

具体原理同上，区别在于我们使用广度优先遍历寻找相连的O节点。为了方便操作我们可以使用队列来实现BFS，其中队列的基本元素是$pair<int,int>$。

class Solution {
public:
    const int dx[4] = {1, -1, 0, 0};
    const int dy[4] = {0, 0, 1, -1};

    void solve(vector<vector<char>>& board) {
        int n = board.size();
        if (n == 0) {
            return;
        }
        int m = board[0].size();
        queue<pair<int, int>> que;
        for (int i = 0; i < n; i++) {
            if (board[i][0] == 'O') {
                que.emplace(i, 0);
                board[i][0] = 'A';
            }
            if (board[i][m - 1] == 'O') {
                que.emplace(i, m - 1);
                board[i][m - 1] = 'A';
            }
        }
        for (int i = 1; i < m - 1; i++) {
            if (board[0][i] == 'O') {
                que.emplace(0, i);
                board[0][i] = 'A';
            }
            if (board[n - 1][i] == 'O') {
                que.emplace(n - 1, i);
                board[n - 1][i] = 'A';
            }
        }
        while (!que.empty()) {
            int x = que.front().first, y = que.front().second;
            que.pop();
            for (int i = 0; i < 4; i++) {
                int mx = x + dx[i], my = y + dy[i];
                if (mx < 0 || my < 0 || mx >= n || my >= m || board[mx][my] != 'O') {
                    continue;
                }
                que.emplace(mx, my);
                board[mx][my] = 'A';
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (board[i][j] == 'A') {
                    board[i][j] = 'O';
                } else if (board[i][j] == 'O') {
                    board[i][j] = 'X';
                }
            }
        }
    }
};