leetcode专题训练 64. Minimum Path Sum

和62题类似，可以参考62题的题解：https://blog.csdn.net/Ema1997/article/details/104080896
用的是动态规划的方法。可以直接跳到62题题解中动态规划部分。

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        m = len(grid)
        n = len(grid[0])

        dp = [[0 for i in range(n)] for j in range(m)]
        for i in range(m):
            for j in range(n):
                if i == 0 and j == 0:
                    dp[i][j] = grid[i][j]
                    continue
                if i == 0:
                    dp[i][j] = dp[i][j-1]+grid[i][j]
                    continue
                if j == 0:
                    dp[i][j] = dp[i-1][j]+grid[i][j]
                    continue
                dp[i][j] = min(dp[i-1][j], dp[i][j-1])+grid[i][j]
        
        return dp[-1][-1]