递归（下）MOOC学习笔记【数据结构与算法】

Recursion（下）

一、找零问题

1. 贪心策略找零（依赖于硬币体系）

def change(num):
    lst = [25,10,5,1]
    dic = {
   25:0, 10:0, 5:0, 1:0}
    pos = 0
    while num >= lst[pos]:
        dic[lst[pos]] += 1 #硬币数量加一
        num -= lst[pos]    #找零金额更新
        while num < lst[pos] and num != 0: 
            pos += 1
    return dic

change(63)   

2. 低效递归找零（贪心策略失效）

def change(coinlst,value):
    mincoins = value
    if value in coinlst:
        return 1
    else:
        for i in [each for each in coinlst if each<=value]:
            numcoins = 1 + change(coinlst,value-i)
            if numcoins < mincoins:
                mincoins = numcoins
    return mincoins
print(change([25,10,5,1],63)) #需要很久才能得到这个结果--6

3. 高效递归找零（贪心策略失效）

def change(coinlst,value,dic = {
   }):
    mincoins = value
    if value in coinlst:
        return 1
    elif value in dic:
        return dic[value]           #若记录的金额重复出现，则不再递归，而是直接返回值
    else:
        for i in [each for each in coinlst if each<=value]:
            numcoins = 1 + change(coinlst,value-i)            
            if numcoins < mincoins:
                mincoins = numcoins
            dic[value] = mincoins    #记录找零最小硬币数
    return mincoins
print(change([25,10,5,1],63))

4. 动态规划找零(得到找零硬币数目)

def change(coinlst,value,mincoins):
    for i in range(1,value+1):
        #初始化一个最大值
        mincoins[i] = i
        for j in [each for each in coinlst if each <= i]:
            numcoins = 1 + mincoins[i-j]
            if numcoins < mincoins[i]:   
                mincoins[i] = numcoins
    return mincoins[value]
print(change([1,5,10,21,25],63,[0]*64))

5. 动态规划找零（得到各面值硬币个数）

def change(coinlst,value,mincoins,newcoin):
    for i in