用动态规划算法求解最少硬币问题 c语言,动态规划算法求解硬币找零问题

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

看着这代码怎么这么熟悉。

package 动态规划找零;

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

int change;

change = scan.nextInt();

int[] coins = {1, 5, 10, 21, 25};

int[] coinsUsed = new int[change];

int[] lastCoin = new int[change];

System.out.println(makeChange(coins, change, coinsUsed, lastCoin));

}

public static int makeChange(int[] coins, int maxChange, int[] coinsUsed, int[] lastCoin) {

coinsUsed[0] = 0;

lastCoin[0] = 1;

for (int cents = 1; cents <= maxChange; cents++) {

int minCoins = cents;

int newCoin = 1;

for (int j = 0; j < coins.length; j++) {

if (coins[j] > cents) {

continue;

}

if (coinsUsed[cents - coins[j]] + 1 < minCoins) {

minCoins = coinsUsed[cents - coins[j]] + 1;

newCoin = coins[j];

}

}

coinsUsed[cents] = minCoins;

lastCoin[cents] = newCoin;

}

return coinsUsed[maxChange];

}

}

weiss的书上的吧