题解 | #迷宫问题#

迷宫问题

https://www.nowcoder.com/practice/cf24906056f4488c9ddb132f317e03bc

path = ['(0,0)']
seen = []
steps = [-1, 1]


def dfs(l, c):
    point = "(" + str(l) + "," + str(c) + ")"
    # print(point)
    seen.append(point)
    if l == m - 1 and c == n - 1:
        # reach the endpoint
        for i in path:
            print(i)
    else:
        for step in steps:
            if 0 <= l + step <= m - 1 and maze[l + step][c] == 1:
                # current point can't go
                point = "(" + str(l + step) + "," + str(c) + ")"
                seen.append(point)
            elif 0 <= l + step <= m - 1 and maze[l + step][c] == 0:
                point = "(" + str(l + step) + "," + str(c) + ")"
                if point in seen:
                    # will not go back
                    pass
                else:
                    path.append(point)
                    dfs(l + step, c)
                    path.pop()
            if 0 <= c + step <= n - 1 and maze[l][c + step] == 1:
                point = "(" + str(l) + "," + str(c + step) + ")"
                seen.append(point)
            elif 0 <= c + step <= n - 1 and maze[l][c + step] == 0:
                point = "(" + str(l) + "," + str(c + step) + ")"
                if point in seen:
                    # will not go back
                    pass
                else:
                    path.append(point)
                    dfs(l, c + step)
                    path.pop()


m, n = list(map(int, input().split()))
maze = []
for _ in range(m):
    maze.append(list(map(int, input().split())))

dfs(0,0)

全部评论

相关推荐

屌丝逆袭咸鱼计划:心态摆好,man,晚点找早点找到最后都是为了提升自己好进正职,努力提升自己才是最关键的😤难道说现在找不到找的太晚了就炸了可以鸡鸡了吗😤早实习晚实习不都是为了以后多积累,大四学长有的秋招进的也不妨碍有的春招进,人生就这样
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务