Python solution...easy to understand.


  • 0
    J
        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]

Log in to reply
 

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