LeetCode上的一道题

Triangle (#120)
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.

解题思路：构建动态规划数组，保存前一行和当前行符合题目要求的路径和，以自底向上的方式，最终归一到第0行的0元素位置。那么动态规划数组的第0个元素即为最小路径和。

代码如下：
class Solution:
    def minimumTotal(self, triangle):
    """
    :type triangle: List[List[int]]
    :rtype: int
    """
    result = triangle[-1]
    for i in range(len(triangle) - 2, -1, -1):
        for j in range(len(triangle[i])):
            result[j] = min(result[j], result[j + 1]) + triangle[i][j]
    return result[0]