class Solution:
def minPathSum(self, grid: List[List[int]]) -> int:
m = len(grid)
n = len(grid[0])
fn = [[0] * n for _ in range(m)]
fn[0][0] = grid[0][0]
for i in range(1, m, 1):
fn[i][0] = grid[i][0] + fn[i-1][0]
for j in range(1, n, 1):
fn[0][j] = grid[0][j] + fn[0][j-1]
for i in range(1,m, 1):
for j in range(1, n, 1):
fn[i][j] = grid[i][j] + min(fn[i-1][j], fn[i][j-1])
return fn[-1][-1]
# 64. 最小路径和
最新推荐文章于 2022-04-25 14:35:14 发布