刷题记录：最小路径和

最小路径和

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        dp = copy.deepcopy(grid)
        for i in range(1,len(grid)):
            dp[i][0] += dp[i-1][0]
        for j in range(1,len(grid[0])):
            dp[0][j] += dp[0][j-1]
        for i in range(1,len(grid)):
            for j in range(1,len(grid[0])):
                dp[i][j] += min(dp[i-1][j],dp[i][j-1])
        return dp[-1][-1]