Leetcode刷题记录——64. 最小路径和

极其基础的dp

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        m = len(grid)
        n = len(grid[0])
        suma = 0
        if m == 1:
            for k in range(n):
                suma += grid[0][k]
            return suma
        if n == 1:
            for k in range(m):
                suma += grid[k][0]
            return suma
        dp = []
        for _ in range(m):
            dp.append([0 for _ in range(n)])
        for i in range(m-1,-1,-1):
            if i == m-1:
                dp[i][-1] = grid[-1][-1]
            else:
                dp[i][-1] = dp[i+1][-1] + grid[i][-1]
        for j in range(n-2,-1,-1):
            dp[-1][j] = dp[-1][j+1] + grid[-1][j]
        for i in range(m-2,-1,-1):
            for j in range(n-2,-1,-1):
                dp[i][j] = min(dp[i+1][j],dp[i][j+1])+grid[i][j]
        print(dp)
        return dp[0][0]