leetcode64. Minimum Path Sum

题目描述（难度：Medium）：

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.
Tags： Array， Dynamic Programming
Similar Problems： (M) Unique Paths， (H) Dungeon Game

分析：最值类动态规划，注意，grid中元素均为非负值
        设dp[i][j]表示从左上角到达grid[i][j]时的最小和值
        dp[i][j] = min(dp[i-1][j], dp[i][j-1])+grid[i][j]

代码实现：

class Solution(object):
    def minPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        m = len(grid)
        n = len(grid[0]) if m else 0
        #1.输入处理
        if m==0 or n==0:
            return 0
        #2.初始化
        dp = [ [0]*n for _ in range(m)]
        dp[0][0] = grid[0][0]
        for i in range(1, m):
            dp[i][0] = dp[i-1][0] + grid[i][0]
        for j in range(1, n):
            dp[0][j] = dp[0][j-1] + grid[0][j]
        #3.dp
        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j]
        return dp[-1][-1]