题目:
给定一个包含非负整数的 m x n 网格,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
示例:
输入:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
输出: 7
解释: 因为路径 1→3→1→1→1 的总和最小。
代码:
class Solution(object):
def minPathSum(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
#二维数组的初始化(记住初始化方法,踩过坑)
res = [[0]*len(grid[0]) for row in range(len(grid))]
res[0][0] = grid[0][0]
for i in range(1,len(grid)):
res[i][0] = res[i-1][0]+grid[i][0]
for j in range(1,len(grid[0])):
res[0][j] = res[0][j-1] + grid[0][j]
for i in range(1,len(grid)):
for j in range(1,len(grid[0])):
up = res[i-1][j]
left = res[i][j-1]
res[i][j] = min(left,up)+grid[i][j]
return res[len(res)-1][len(res[0])-1]