Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

class Solution(object):

def minimumTotal(self, triangle): dp = triangle[-1] for i in range(len(triangle)-2,-1,-1): for j in range(len(triangle[i])): dp[j] = min(dp[j], dp[j+1]) + triangle[i][j] return dp[0]

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.