在for循环中显示2D网格迷宫中的周期

# 创建迷宫网格
maze = [
    [1, 1, 1, 1, 1],
    [1, 0, 0, 0, 1],
    [1, 1, 1, 0, 1],
    [1, 0, 0, 0, 1],
    [1, 1, 1, 1, 1]
]

# 标记已访问的单元格
visited = [[False for _ in range(len(maze[0]))] for _ in range(len(maze))]

# 深度优先搜索函数
def dfs(row, col):
    # 检查边界和访问状态
    if row < 0 or row >= len(maze) or col < 0 or col >= len(maze[0]) or visited[row][col] or maze[row][col] == 1:
        return
    
    # 标记当前单元格为已访问
    visited[row][col] = True
    
    # 在周期路径上显示特殊符号或颜色
    maze[row][col] = '*'
    
    # 递归搜索相邻的单元格
    dfs(row - 1, col)  # 上
    dfs(row + 1, col)  # 下
    dfs(row, col - 1)  # 左
    dfs(row, col + 1)  # 右

# 遍历迷宫网格
for i in range(len(maze)):
    for j in range(len(maze[0])):
        if not visited[i][j] and maze[i][j] == 0:
            dfs(i, j)

# 打印显示迷宫
for row in maze:
    for cell in row:
        print(cell, end=' ')
    print()