LeetCode 130. Surrounded Regions

LeetCode 130

这个题目使用逆向思维会更加容易做，考虑那些是不能全部被X包围的，然后把这些排除掉。要不被X包围必然是和边界上的一个O有连接，那么我们从边界上的O出发，做DFS或者BFS，把所有的这些O找出来，其他的都是可以被X包围的。

    def solve(self, board: List[List[str]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        def dfs(x, y, M, N, board):
            if x < 0 or y < 0 or x >= M or y >=N or board[x][y] != 'O':
                return
            board[x][y] = 'V'
            diff = [[1, 0], [-1, 0], [0, 1], [0, -1]]
            for dx, dy in diff:
                dfs(x+dx, y+dy, M, N, board)

        if not board: return
        M = len(board)
        N = len(board[0])

        for i in range(0, M):
            if board[i][0] == 'O':
                dfs(i, 0, M, N, board)
            if board[i][N-1] == 'O':
                dfs(i, N-1, M, N, board)
        
        for j in range(0, N):
            if board[0][j] == 'O':
                dfs(0, j, M, N, board)
            if board[M-1, j] == 'O':
                dfs(M-1, j, M, N, board)

        for i in range(0, M):
            for j in range(0, N):
                if board[i][j] == 'V':
                    board[i][j] = 'O'
                else:
                    board[i][j] = 'X'