coins = [1,2,5]
amount = 11
组成11元所需要的最少的钱币的个数
let coins = [1,2,5];
let count =11;
let dp =[0];
for(let i=1;i<=count;i++){
dp[i]=count
}
for(let i=1;i<=count;i++){
for(let j=0;j<coins.length;j++){
if(coins[j]<=i){
dp[i]=Math.min(dp[i],dp[i-coins[j]]+1)
}
}
}
dp[count]>count?-1:dp[count]
console.log(dp[count])