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).

if not triangle: return 0 for i in xrange(len(triangle)-2, -1, -1): for j in xrange(0, len(triangle[i])): triangle[i][j] = min(triangle[i + 1][j], triangle[i + 1][j + 1]) + triangle[i][j] return triangle[0][0]

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