最小路径和

def solve():
    def minPathSum(____):
        m, n = len(____), len(____)
        dp = [[____] * n for _ in range(____)]
        dp[____][____] = grid[____][____]
        for i in range(____, m):
            dp[i][____] = dp[i-____][____] + grid[i][____]
        for j in range(____, n):
            dp[____][j] = dp[____][j-____] + grid[____][j]
        for i in range(____, m):
            for j in range(____, n):
                dp[i][j] = min(____) + grid[i][j]
        return dp[m-____][n-____]
    print(minPathSum(____))