Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
Example:
Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1→3→1→1→1 minimizes the sum.
从头记录好到每个点的最短路径即可.每个点的最短路径=min(上面,左面) +自身
class Solution(object):
def minPathSum(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
r,c = len(grid),len(grid[0])
for i in range(1, r):
grid[i][0] += grid[i-1][0]
for i in range(1, c):
grid[0][i] += grid[0][i-1]
for i in range(1,r):
for j in range(1,c):
grid[i][j] += min(grid[i-1][j], grid[i][j-1])
return grid[-1][-1]