贪心算法:
# Greedy Algorithm
import numpy as np
def change(big, real):
money = [100, 50, 20, 10, 5, 1, 0.5, 0.1]
mchange = 0
t = big-real
amount = np.zeros((1, len(money)),dtype=int)
i = 0
while t >= mchange:
if (t-mchange) >= money[i]:
mchange = mchange + money[i]
mchange = round(mchange, 1)
amount[0, i] = amount[0, i] + 1
else:
i = i + 1
if i > len(money)-1:
break
print('找零为:', end='')
for i in range(len(money)):
if amount[0, i] != 0:
print('面值{}元的{}张'.format(money[i], amount[0, i]), end=',')
print('总共找零{}张,找零金额为{}元'.format(amount.sum(), mchange))
if __name__ == "__main__":
real = eval(input('请输入顾客应付金额:'))
big = eval(input('请输入顾客实付金额:'))
change(big, real)
找零结果如下图所示:
修改一下面额:
money = [100, 50, 21, 20, 10, 5, 1, 0.5, 0.1]
计算结果如下图所示,实际的最优解应该是找3张面值21元的,但贪心算法计算结果却是5张,可见,有的时候贪心算法求解不出最优解,