python学习第9周：LeetCode 120. Triangle题解

#120
题目来源：
https://leetcode.com/problems/triangle


题目分析：
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）的空间复杂度，可以用一个长度为n的数组存储到第i个点的最短路径长度，然后每次从大往小更新数组。


代码如下：

 

 

class Solution:
    def minimumTotal(self, triangle):
        """
        :type triangle: List[List[int]]
        :rtype: int
        """
        size = len(triangle);
        num = [0]*size;
        num[0] = triangle[0][0];
        for i in range(1,size):
            num[i] = num[i-1] + triangle[i][i];
            j = i - 1
            while j > 0:
                num[j] = min(num[j], num[j-1]) + triangle[i][j];
                j -= 1;
            num[0] = num[0] + triangle[i][0];
        minm = num[0];
        for i in range(1,size):
            minm = min(num[i], minm);
        return minm;