64. Minimum Path Sum(最小走棋盘 动态规划)

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 1:

[[1,3,1],
 [1,5,1],
 [4,2,1]]

Given the above grid map, return 7. Because the path 1→3→1→1→1 minimizes the sum.

 

走的方向决定了同一个位置不会走2次。

如果当前位置是（x,y）上一步来自哪呢？

上一步可能从左边【x-1,y】来，也可能从上边来[x,y-1] ,所以当前的最小路径就是 min(左边 + 当前值 ， 上边+当前值） 

 

dp[0][0] = a[0][0]

dp[x][y] = min(dp[x-1][y]+a[x][y],+dp[x][y-1]+a[x][y])

 

 

 

 class Solution:
     def minPathSum(self, grid):
         """
         :type grid: List[List[int]]
         :rtype: int
         """
         dp = []
         for i in grid:
             dp.append(i)

         for i in range(len(grid)):
             for j in range(len(grid[0])):
                 if(i==0 and j ==0):
                     dp[i][j] = grid[i][j]
                 elif i==0 and j !=0 :
                         dp[i][j] = dp[i][j-1] + grid[i][j]
                 elif i!=0 and j==0:
                         dp[i][j] = dp[i-1][j] + grid[i][j]
                 else:
                     dp[i][j] = min(dp[i-1][j]+grid[i][j],dp[i][j-1]+grid[i][j])
         return dp[i][j]