class Solution:
def maxValue(self, grid: List[List[int]]) -> int:
for i in range(len(grid)): #行
for j in range(len(grid[0])): #列
if i==0 and j==0:
continue
elif i==0:
grid[i][j]+=grid[i][j-1]
elif j==0:
grid[i][j]+=grid[i-1][j]
else:
grid[i][j]+=max(grid[i-1][j],grid[i][j-1])
return grid[-1][-1]
【剑指 Offer 47. 礼物的最大价值】【力扣刷题】【Python】【动态规划】
最新推荐文章于 2023-08-28 16:17:42 发布