【题目】给定数组arr,arr中所有的值都为正数且不重复。每个值代表一种面值的货币,每种面值的货币可以使用任意张,再给定一个整数aim代表要找的钱数,求组成aim的最少货币数。
【代码1】:时间与额外空间复杂度O(N*aim)
import numpy as np
from xmlrpc.client import MAXINT
def mincoin(arr,aim):
if len(arr)<0:
print("No coin provided for change!")
arr.sort()
arr.reverse()
if aim == 0:
print("Aim is 0, no need to change!")
dp = np.zeros((len(arr),aim+1))
i = 0
j = 0
left = aim
maxval = MAXINT
for j in range(1,aim+1):
dp[0][j] = maxval
if j-arr[0] >=0 and dp[0][j-arr[0]] != maxval:
dp[0][j] = dp[0][j-arr[0]]+1
for i in range(1,len(arr)):
for j in range(1,aim+1):
left = maxval
if j-arr[i] >=0 and dp[i][j-arr[i]] != maxval: