题解 | #迷宫问题#
迷宫问题
https://www.nowcoder.com/practice/cf24906056f4488c9ddb132f317e03bc
# DFS
m,n=list(map(int,input().strip().split()))
g=[list(map(int,input().strip().split())) for _ in range(m)]
def dfs(x,y,z):
if (x,y)==(m-1,n-1):
for i in z:print(f'({i[0]},{i[1]})')
if x+1<m and g[x+1][y]!=1 and (x+1,y) not in z:
dfs(x+1,y,z+[(x+1,y)])
if y+1<n and g[x][y+1]!=1 and (x,y+1) not in z:
dfs(x,y+1,z+[(x,y+1)])
if x-1>=0 and g[x-1][y]!=1 and (x-1,y) not in z:
dfs(x-1,y,z+[(x-1,y)])
if y-1>=0 and g[x][y-1]!=1 and (x,y-1) not in z:
dfs(x,y-1,z+[(x,y-1)])
dfs(0,0,[(0,0)])
投递滴滴等公司10个岗位
米哈游一面168人在聊