64. 最小路径和

64. 最小路径和

class Solution(object):
    def minPathSum(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        m = len(grid)
        n = len(grid[0])
        res = [[0] * n for i in range(m)]
        res[0][0] = grid[0][0]
        for j in range(1, n):
            res[0][j] = grid[0][j] + res[0][j-1]
        for i in range(1, m):
            res[i][0] = grid[i][0] + res[i-1][0]
        for i in range(1, m):
            for j in range(1, n):
                res[i][j] = min(res[i][j-1], res[i-1][j]) + grid[i][j]
                #print i, j, res[i][j]
        return res[m-1][n-1]

思路：
动态规划。
综上，时间复杂度O(mn)，空间复杂度是O(mn)。