<qiyuangong>322_Coin_Change_1.py
def coinChange( coins, amount):
    if amount == 0:
        return 0
    if coins is None or len(coins) == 0:
        return -1
    coins.sort()
    dp = [1000000000] * (amount + 1)
    for i in range(1, amount + 1):
        for coin in coins:
            if i == coin:
                dp[i] = 1
                break
            elif i > coin:
                dp[i] = min(dp[i], dp[i - coin] + 1)
    if dp[amount] == 1000000000:
        return -1
    return dp[amount]
def sample_funcname ( var_0 , var_1 ) :
    if var_1 == 0 :
        return 0
    if var_0 is None or len ( var_0 ) == 0 :
        return - 1
    var_0.sort ( )
    var_8 = [ 1000000000 ] * ( var_1 + 1 )
    for var_10 in range ( 1 , var_1 + 1 ) :
        for var_11 in var_0 :
            if var_10 == var_11 :
                var_8 [ var_10 ] = 1
                break
            elif var_10 > var_11 :
                var_8 [ var_10 ] = min ( var_8 [ var_10 ] , var_8 [ var_10 - var_11 ] + 1 )
    if var_8 [ var_1 ] == 1000000000 :
        return - 1
    return var_8 [ var_1 ]
