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.
求一个三角形二维数组从顶端到低端的最小路径和~可以用动态规划来做,因为题目要求用O(n)空间,所以可以采用一维动态规划~对于某一个元素来说,它的最小路径和是它上一层相邻的两个元素的最小路径和加上它自身的值~空间上我们只维护一层,因为当前层只用到上一层的元素,这样空间复杂度就为O(n)~ 代码如下(dp[i]代表某一层第i个元素的最小路径和,然后一层一层叠加~还有要注意的是,为了不覆盖需要的数据,每一层扫描的时候应该自右向左~然后第一个和最后一个元素需要分开处理一下~)
class Solution:
# @param triangle, a list of lists of integers
# @return an integer
def minimumTotal(self, triangle):
if triangle is None or len(triangle) == 0: return 0
dp = [0] * len(triangle)
dp[0] = triangle[0][0]
for i in xrange(1, len(triangle)):
dp[i] = dp[i - 1] + triangle[i][i]
for j in xrange(i - 1, 0, -1):
dp[j] = min(dp[j - 1], dp[j]) + triangle[i][j]
dp[0] = dp[0] + triangle[i][0]
minVal = dp[0]
for i in xrange(1, len(triangle)):
minVal = min(minVal, dp[i])
return minVal
还有一种解法,从低端向顶端进行动态规划,原理和上面相似,只是对元素来说,它的最小路径和是它下一层相邻的两个元素的最小路径和加上它本身的值,这种解法不仅能免去对每层第一个和最后一个元素的单独处理,还能省去最后找最小值的步骤;代码如下~
class Solution:
# @param triangle, a list of lists of integers
# @return an integer
def minimumTotal(self, triangle):
if triangle is None or len(triangle) == 0: return 0
dp = triangle[-1][:]
for i in xrange(len(triangle) - 2, -1, -1):
for j in xrange(i + 1):
dp[j] = min(dp[j], dp[j + 1]) + triangle[i][j]
return dp[0]
( 这两种解法都是稍微看了一下思路,自己写出来的,而且都很顺利就AC了,开心)