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.
做题思路:
从上往下看,对于每一层的每个格子来说,从顶上到达它的最短距离是从上一层能到达它的一个或两个格子的距离的最小值加上它本身。
可以使用一个数组,每次迭代更新为新的一行的最短到达距离,并用一个辅助数组计算新的一行。这样额外空间是2n,符合O(n)的要求。
代码:
class Solution(object):
def minimumTotal(self, triangle):
"""
:type triangle: List[List[int]]
:rtype: int
"""
row = [triangle[0][0]]
for i in range(len(triangle) - 1):
temp = []
for j in range(i + 2):
if j == 0:
temp.append(row[0] + triangle[i + 1][0])
elif j == i + 1:
temp.append(row[i] + triangle[i + 1][i + 1])
else:
temp.append(min(row[j - 1], row[j]) + triangle[i + 1][j])
row = temp[:]
return min(row)