<qiyuangong>120_Triangle_1.py
def minimumTotal( triangle):
    if triangle is None or len(triangle) == 0:
        return 0
    ls = len(triangle)
    dp = [0] * ls
    dp[0] = triangle[0][0]
    for i in range(1, ls):
        dp[i] = dp[i - 1] + triangle[i][i]
        for j in reversed(range(1, i)):
            dp[j] = min(dp[j - 1] + triangle[i][j], dp[j] + triangle[i][j])
        dp[0] = dp[0] + triangle[i][0]
    return min(dp)
def sample_funcname ( var_0 ) :
    if var_0 is None or len ( var_0 ) == 0 :
        return 0
    var_4 = len ( var_0 )
    var_5 = [ 0 ] * var_4
    var_5 [ 0 ] = var_0 [ 0 ] [ 0 ]
    for var_8 in range ( 1 , var_4 ) :
        var_5 [ var_8 ] = var_5 [ var_8 - 1 ] + var_0 [ var_8 ] [ var_8 ]
        for var_10 in reversed ( range ( 1 , var_8 ) ) :
            var_5 [ var_10 ] = min ( var_5 [ var_10 - 1 ] + var_0 [ var_8 ] [ var_10 ] , var_5 [ var_10 ] + var_0 [ var_8 ] [ var_10 ] )
        var_5 [ 0 ] = var_5 [ 0 ] + var_0 [ var_8 ] [ 0 ]
    return min ( var_5 )
