动态规划之找零钱问题

输入参数:1.需要找的零钱数;2.拥有的零钱面额(假设每种面额足量)
输出:最少需要找的零钱张数量
例：需要找零6块钱，零钱面值为 1,2, 5那么至少需要两张零钱，即1和5。
输入示例：
6
1 2 5
输出示例：
2

import java.util.Scanner;

public class CoinChange {
  public static int findMinCoinNeeded(int money, int[] coinkinds) {
    int kinds = coinkinds.length;
    int mincoin = 0;
    int[] coinUseCache = new int[money + 1];//存储小于目标money的子问题结果，0位置空闲。
    for (int i = 1; i <= money; i++) {
      mincoin = i;
      for (int j = 0; j < kinds; j++) {
        if (coinkinds[j] <= i) {
          mincoin = Integer.min(mincoin, coinUseCache[i - coinkinds[j]] + 1);//子问题
        }
      }
      coinUseCache[i] = mincoin;
    }
    return coinUseCache[money];
  }

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    int money = scanner.nextInt();
    scanner.nextLine();
    String[] line = scanner.nextLine().split(" ");
    int coinkinds[] = new int[line.length];
    int index = 0;
    for (String i : line) {
      coinkinds[index++] = Integer.parseInt(i);
    }
    System.out.println(findMinCoinNeeded(money, coinkinds));
  }
}