原题
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).
Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.
解法
构造ans, 计算ans[i][j].
ans[i][j] = ans[i][j] + min(ans[i-1][max(0,j-1)], ans[i-1][min(j, len(ans[i])-2)])
代码
class Solution(object):
def minimumTotal(self, triangle):
"""
:type triangle: List[List[int]]
:rtype: int
"""
ans = copy.deepcopy(triangle)
for i in range(1, len(triangle)):
for j in range(len(ans[i])):
ans[i][j] = ans[i][j] + min(ans[i-1][max(0,j-1)], ans[i-1][min(j, len(ans[i])-2)])
return min(ans[-1])