题解 | #迷宫问题#

DFS 深度优先搜索

def dfs(matrix, x, y, path, dst):
    if (x,y) == dst:
        path.append((x,y))
        for i in path:
            print("({},{})".format(i[0],i[1]))
        return 
    
    
    if not 0<=x<len(matrix) or not 0<=y<len(matrix[0])\
    or matrix[x][y] == 1 or (x,y) in path:
        return
    
    path.append((x,y))
    dfs(matrix, x+1, y, path, dst)
    dfs(matrix, x, y+1, path, dst)
    dfs(matrix, x-1, y, path, dst)
    dfs(matrix, x, y-1, path, dst)
    path.pop()
while True:
    try:
        x, y = list(map(int, input().split()))
        dst = (x-1, y-1)
        matrix = []
        for i in range(x):
            matrix.append(list(map(int, input().split())))
        dfs(matrix, 0, 0, [], dst)
        
    except:
        break