public class TanXinCoin {
public static void tanXinCoin(int[] coins, int coinsLength, int totalMoney) {
if(coins == null || coinsLength < 0)
return ;
for(int i = 0; i < coinsLength; i++) {
while(totalMoney >= coins[i] && totalMoney > 0) {
totalMoney -= coins[i];
System.out.print(coins[i] + " ");
}
}
}
public static void main(String[] args) {
int totalMoney = 30;
int[] coins = {11, 5, 2, 1}; //贪心要求硬币面值从大到小排序
tanXinCoin(coins, coins.length, totalMoney);
}
贪心算法求最少付出硬币个数
最新推荐文章于 2024-01-21 19:53:56 发布