**
- 思路:递归+回溯, 左上——> 右下寻找一条最佳路径,碰到 实在过不去(爆发次数用尽后,又遇到”高山“的)进行回溯,另行查找,
**
输入数据 没有按照标准输入写, 仅当测试用例进行试验
nums = [[10, 20, 30, 400], [100, 15, 140, 160], [200, 230, 260, 290], [300, 40, 50, 600]]
m, n = len(nums), len(nums[0])
vis = [[False] * n for _ in range(m)]
height = 10
res = []
ans = m*n
def dfs(i, j, path, cnt):
# i, j: 位置坐标; path: 记录搜索路径, cnt: 记录突破次数
vis[i][j] = True
ans = m * n
if cnt < 0 or i == m or i < 0 or j == n or j < 0 : # 超越边界或 突破次数<0, 直接回溯
return m * n
if i == m - 1 and j == n - 1: # 满足要求且找到终点的,返回 ans
return len(path) - 1
for nx, ny in [[i - 1, j], [i + 1, j], [i, j - 1], [i, j + 1]]:
if 0<= nx < m and 0 <= ny < n and not vis[nx][ny]:
if (not path) or (path and abs(nums[nx][ny] - path[-1]) <= height):
ans = min(ans, dfs(nx, ny, path + [nums[nx][ny]], cnt) )
elif abs(nums[nx][ny] - path[-1]) > height :
ans = min(ans, dfs(nx, ny, path + [nums[nx][ny]], cnt - 1))
vis[nx][ny] = False
return ans
print(dfs(0, 0, [nums[0][0]], 3))