LeetCode - 解题笔记 - 130 - Surrounded Regions

Solution 1

根据题目中的要求，满足要求的区域就是没有抵达边界的区域，因此直接从边界区域使用BFS扩展拆查询O的连通区域，标记后，剩下的部分一律置为X

• 时间复杂度：$O(N\times M)$，其中$N$和$M$分别为输入地图的行数和列数，全图遍历两次，边界遍历一次
• 空间复杂度：$O(N\times M)$，其中$N$和$M$分别为输入地图的行数和列数，需要一个visited的数组标记需要的连通分量

class Solution {
public:
    void solve(vector<vector<char>>& board) {
        
        vector<vector<bool>> visited(board.size(), vector<bool>(board[0].size(), false));
        
        queue<pair<int, int>> q;
        
        // 四周遍历：第一行从左到右
        for (int i = 0; i < board[0].size(); i++) {
            if (board[0][i] == 'O') {
                q.emplace(0, i);
                visited[0][i] = true;
                // cout << 0 << " " << i << endl;
            }
        }
        // 四周遍历：最后一列从上到下
        for (int i = 1; i < board.size(); i++) {
            if (board[i][board[0].size() - 1] == 'O') {
                q.emplace(i, board[0].size() - 1);
                visited[i][board[0].size() - 1] = true;
                // cout << i << " " << board[0].size() - 1 << endl;
            }
        }
        // 四周遍历：最后一行从右到左
        for (int i = board[0].size() - 2; i >= 0; i--) {
            if (board[board.size() - 1][i] == 'O') {
                q.emplace(board.size() - 1, i);
                visited[board.size() - 1][i] = true;
                // cout << board.size() - 1 << " " << i << endl;
            }
        }
        // 四周遍历：第一列从下到上
        for (int i = board.size() - 2; i > 0; i--) {
            if (board[i][0] == 'O') {
                q.emplace(i, 0);
                visited[i][0] = true;
                // cout << i << " " << 0 << endl;
            }
        }
        
        // bfs：从四周入口的O区域，标记
        while (!q.empty()) {
            int x = q.front().first, y = q.front().second;
            q.pop();
            
            for (int i = 0; i < 4; i++) {
                int xNew = x + offsetX[i], yNew = y + offsetY[i];
                if (xNew < 0 || yNew < 0 || xNew >= board.size() || yNew >= board[0].size() || board[xNew][yNew] != 'O' || visited[xNew][yNew]) {
                    continue;
                }
                q.emplace(xNew, yNew);
                visited[xNew][yNew] = true;
            }
        }
        
        
        for (int i = 0; i < board.size(); i++) {
            for (int j = 0; j < board[0].size(); j++) {
                if (board[i][j] == 'O' && !visited[i][j]) {
                    board[i][j] = 'X';
                }
            }
        }
    }
    
private:
    const int offsetX[4] = {1, -1, 0, 0};
    const int offsetY[4] = {0, 0, 1, -1};
};

Solution 2

Solution 1的Python实现

class Solution:
    def solve(self, board: List[List[str]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        offsetX = [1, -1, 0, 0]
        offsetY = [0, 0, 1, -1]
        
        visited = [[False] * len(board[0])  for i in range(len(board))]
        q = collections.deque()
        
        for i in range(len(board[0])):
            if board[0][i] == 'O':
                q.append((0, i))
                visited[0][i] = True
                # print(0, i)
                
        for i in range(1, len(board)):
            if board[i][len(board[0]) - 1] == 'O':
                q.append((i, len(board[0]) - 1))
                visited[i][len(board[0]) - 1] = True
                # print(i, len(board[0]) - 1)
                
        for i in range(len(board[0]) - 2, -1, -1):
            if board[len(board) - 1][i] == 'O':
                q.append((len(board) - 1, i))
                visited[len(board) - 1][i] = True
                # print(len(board) - 1, i)
                
        for i in range(len(board) - 2, 0, -1):
            if board[i][0] == 'O':
                q.append((i, 0))
                visited[i][0] = True
                # print(i, 0)
                
        # print(visited)
                
        while q:
            x, y = q.popleft()
            for ix, iy in zip(offsetX, offsetY):
                xNew = x + ix
                yNew = y + iy
                
                if 0 <= xNew < len(board) and 0 <= yNew < len(board[0]) and board[xNew][yNew] == "O" and not visited[xNew][yNew]:
                    q.append((xNew, yNew))
                    visited[xNew][yNew] = True
                    
        for i in range(len(board)):
            for j in range(len(board[0])):
                if board[i][j] == 'O' and not visited[i][j]:
                    board[i][j] = 'X'