原本想要写第二题
被你版系列文搞到:(
py好难
我一定有一堆地方写的有问题
懒得检查 对不起
def dfs(self, i, j, cur, cur_max, grid: List[List[int]]) -> int:
if self.visit[i][j] == 1 or grid[i][j] == 0:
return cur
m = len(grid)
n = len(grid[0])
self.visit[i][j] = 1
cur += grid[i][j]
if i-1 >= 0:
cur_max = max(cur_max, self.dfs(i-1, j, cur, cur_max, grid))
if i+1 < m:
cur_max = max(cur_max, self.dfs(i+1, j, cur, cur_max, grid))
if j-1 >= 0:
cur_max = max(cur_max, self.dfs(i, j-1, cur, cur_max, grid))
if j+1 < n:
cur_max = max(cur_max, self.dfs(i, j+1, cur, cur_max, grid))
self.visit[i][j] = 0
return cur_max
def getMaximumGold(self, grid: List[List[int]]) -> int:
ans = 0
for i in range(len(grid)):
for j in range(len(grid[0])):
self.visit = [[0]*len(grid[0]) for i in range(len(grid))]
ans = max(ans, self.dfs(i, j, 0, 0, grid))
return ans