DFS总结

递归

n = length
m = width
def dfs(x, y):
    if not 0 <= x < n or not 0 <= y < m: # 判断条件
         return
     board[x][y] = "A"###操作
     dfs(x + 1, y)
     dfs(x - 1, y)
     dfs(x, y + 1)
     dfs(x, y - 1)

For 循环
加一个排除条件避免重复进。

def dfs(record, stack, i, j):
    stack.append([i, j])
    record[(i, j)] = 1
    while stack:
        m, n = stack[-1]
        ocean[(m, n)] = 1
        if 条件 and (m + 1, n) not in ocean:
            stack.append([m+1, n])
            
        elif 条件 and (m - 1, n) not in ocean:
            stack.append([m - 1, n])
            
        elif 条件 and (m, n + 1) not in ocean:
            stack.append([m, n+1])
 
        elif 条件 and (m, n - 1) not in ocean:
            stack.append([m, n-1])

        else:
            stack.pop()

举例：

被围绕的区域

给定一个二维的矩阵，包含 ‘X’ 和 ‘O’（字母 O）。

找到所有被 ‘X’ 围绕的区域，并将这些区域里所有的 ‘O’ 用 ‘X’ 填充。

示例:

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

class Solution:
    def solve(self, board: List[List[str]]) -> None:
        if not board:
            return
        
        n, m = len(board), len(board[0])

        def dfs(x, y):
            if not 0 <= x < n or not 0 <= y < m or board[x][y] != 'O':
                return
            
            board[x][y] = "A"
            dfs(x + 1, y)
            dfs(x - 1, y)
            dfs(x, y + 1)
            dfs(x, y - 1)
        
        for i in range(n):
            dfs(i, 0)
            dfs(i, m - 1)
        
        for i in range(m - 1):
            dfs(0, i)
            dfs(n - 1, i)
        
        for i in range(n):
            for j in range(m):
                if board[i][j] == "A":
                    board[i][j] = "O"
                elif board[i][j] == "O":
                    board[i][j] = "X"