Triangle Leetcode Python

Given a triangle, find the minimum path sum from top to bottom. Each step of the 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 one (i.e., 2 + 3 + 5 + 1 = 11).

This topic uses the dynamic programming, from the bottom to the upper order to add to obtain the solution.

This was a DP problem, we can solve this problem by suming up from the bottom to the top.

Class solution:    # @param triangle, a list of lists of integers    # @return An integer    def minimumtotal (self, tri Angle):        rownum=len (triangle) for        index in reversed (range (rownum)):            if index==rownum-1:                m=triangle[ Index]            else: for                J in Range (index+1):                    m[j]=triangle[index][j]+min (m[j],m[j+1])        return m[0]

Triangle Leetcode Python