题目
思路
滚动数组
代码
class Solution:
"""
@param triangle: a list of lists of integers
@return: An integer, minimum path sum
"""
def minimumTotal(self, triangle):
# write your code here
dp = [i for i in triangle[len(triangle) - 1]]
for i in range(len(triangle) - 1)[::-1]:
for j in range(len(triangle[i])):
dp[j] = triangle[i][j] + min(dp[j], dp[j + 1])
return dp[0]