<doocs>0746.Min Cost Climbing Stairs_1.py
def minCostClimbingStairs( cost: List[int]) -> int:
    a = b = 0
    for i in range(1, len(cost)):
        a, b = b, min(a + cost[i - 1], b + cost[i])
    return b
def sample_funcname ( var_0 : List [ int ] ) -> int :
    var_5 = var_3 = 0
    for var_9 in range ( 1 , len ( var_0 ) ) :
        var_5 , var_3 = var_3 , min ( var_5 + var_0 [ var_9 - 1 ] , var_3 + var_0 [ var_9 ] )
    return var_3
