leetcode 【 Minimum Path Sum 】python 实现

题目：

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.

 

代码：oj测试通过 Runtime: 102 ms

class Solution:
    # @param grid, a list of lists of integers
    # @return an integer
    def minPathSum(self, grid):
        # none case
        if grid is None:
            return None
        # store each step on matrix
        step_matrix=[[0 for i in range(len(grid[0]))] for i in range(len(grid))]
        # first row
        tmp_sum = 0
        for i in range(len(grid[0])):
            tmp_sum = tmp_sum + grid[0][i]
            step_matrix[0][i] = tmp_sum
        # first line
        tmp_sum = 0
        for i in range(len(grid)):
            tmp_sum = tmp_sum + grid[i][0]
            step_matrix[i][0] = tmp_sum
        # dynamic program other positions in gird
        for row in range(1,len(grid)):
            for col in range(1,len(grid[0])):
                step_matrix[row][col]=grid[row][col]+min(step_matrix[row-1][col],step_matrix[row][col-1])
        # return the minimun sum of path
        return step_matrix[len(grid)-1][len(grid[0])-1]

 

思路：

动态规划常规思路。详情见http://www.cnblogs.com/xbf9xbf/p/4250359.html这道题。

需要注意的是，动态规划迭代条件step_matrix[][]=grid[][]+min(...)

min里面的一定要是step_matrix对应位置的元素。一开始写成grid对应的元素，第一次没有AC，修改后第二次AC了。