class Solution: def minPathSum(self, grid) -> int: m=len(grid) n=len(grid[0]) if m==0 or n==0: return 0 if m==1 and n==1: return grid[0][0] for i in range(1,n): grid[0][i]=grid[0][i]+grid[0][i-1] for j in range(1,m): grid[j][0]=grid[j-1][0]+grid[j][0] for i in range(1,n): for j in range(1,m): grid[j][i]=min(grid[j][i]+grid[j-1][i],grid[j][i]+grid[j][i-1]) return grid[m-1][n-1]
执行用时 :196 ms, 在所有 python3 提交中击败了22.46%的用户
内存消耗 :15.4 MB, 在所有 python3 提交中击败了5.12%的用户
——2019.10.14