给定一个包含非负整数的 m x n 网格 grid ,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
示例 1:
输入:grid = [[1,3,1],[1,5,1],[4,2,1]]
输出:7
解释:因为路径 1→3→1→1→1 的总和最小。
示例 2:
输入:grid = [[1,2,3],[4,5,6]]
输出:12
# 解题
# 定义解题方法:
def fun1(grid):
# 用一个矩阵min_path来记录到达某位置的最小路径和,动态规划
# min_path[i][j] = min(min_path[i-1][j], min_path[i][j-1])+grid[i][j]
min_path = [[0] * len(grid[0]) for _ in range(len(grid))]
min_path[0][0] = grid[0][0]
for i in range(1, len(grid[0])):
min_path[0][i] = min_path[0][i - 1] + grid[0][i]
for j in range(1, len(grid)):
min_path[j][0] = min_path[j - 1][0] + grid[j][0]
for i in range(1, len(grid)):
for j in range(1, len(grid[0])):
min_path[i][j] = min(min_path[i - 1][j], min_path[i][j - 1]) + grid[i][j]
return min_path[-1][-1]
# 根据题目输入例子进行验证
grid = [[1, 3, 1], [1, 5, 1], [4, 2, 1]]
print(fun1(grid))