[LeetCode]130. 被围绕的区域

130. 被围绕的区域

难度：中等

给你一个 m x n 的矩阵 board ，由若干字符 'X' 和 'O' ，找到所有被 'X' 围绕的区域，并将这些区域里所有的 'O' 用 'X' 填充。

示例 1：

输入：board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
输出：[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
解释：被围绕的区间不会存在于边界上，换句话说，任何边界上的 'O' 都不会被填充为 'X'。 任何不在边界上，或不与边界上的 'O' 相连的 'O' 最终都会被填充为 'X'。如果两个元素在水平或垂直方向相邻，则称它们是“相连”的。

示例 2：

输入：board = [["X"]]
输出：[["X"]]

提示：

• m == board.length
• n == board[i].length
• 1 <= m, n <= 200
• board[i][j] 为 'X' 或 'O'

---

class Solution:
    def solve(self, board: List[List[str]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        visited = set()
        m = len(board)
        n = len(board[0])
        directions = [[1,0],[0,1],[-1,0],[0,-1]]
        
        def func(i,j):
            board[i][j] = "A"
            for vi, vj in directions:
                newi, newj = i+vi, j+vj
                if newi >= 0 and newi <= m - 1 and newj >= 0 and newj <= n - 1:
                    if board[newi][newj] == "O":
                        func(newi, newj)
                
        for i in range(m):
            for j in range(n):
                if i == 0 or j == 0 or i == m - 1 or j == n - 1:
                    if board[i][j] == "O":
                        func(i,j)
        
        for i in range(m):
            for j in range(n):
                board[i][j] = "O" if board[i][j] == "A" else "X"
        return board