解法1类似于上一题初始状态 状态转移第0行和第0列的初始状态设置class Solution: def minPathSum(self, grid: List[List[int]]) - int: # dp[i][j] - 表示到达dp[i][j]的最小路径长度 # 初始条件第0列和第0行 m len(grid) n len(grid[0]) dp [[0]*n for _ in range(m)] tmp 0 for i in range(m): tmp grid[i][0] dp[i][0] tmp tmp 0 for i in range(n): tmp grid[0][i] dp[0][i] tmp # 状态转移 for i in range(1,m): for j in range(1,n): dp[i][j] min(dp[i-1][j],dp[i][j-1]) grid[i][j] return dp[m-1][n-1]