322. 零钱兑换

1. 动态规划
2. 设$dp[n]$代表$amount$为$n$的时候可以使用最少的硬币数量组成这个amount。
3. 那么$dp[n]=\underset{c=coins[0]...coins[n-1]}{\min }(dp[n-c]+1),ifi-coins>=0$
4. $java$的代码如下

import java.util.Arrays;

class Solution {
    int[] coins_;
    int amount_;
	
    public int coinChange(int[] coins, int amount) {
        coins_ = coins;
        amount_ = amount;
        int[] dp = new int[amount + 1];
        // Arrays.fill(dp, Integer.MAX_VALUE);
        Arrays.fill(dp, 0x3f3f3f3f);
        dp[0] = 0;
        for (int i = 1; i <= amount; i++) {
            for (int coin : coins_) {
                if (i - coin >= 0) {
                    dp[i] = Math.min(dp[i - coin] + 1,dp[i]);
                }
            }
        }
        if (dp[amount] == 0x3f3f3f3f) {
            return -1;
        }
        return dp[amount];
    }

    public static void main(String[] args) {
        Solution sol = new Solution();
        int[] coins = { 1, 2, 5 };
        // int[] coins = {2};
        // int amount = 11;
        int amount = 3;
        System.out.println(sol.coinChange(coins, amount));
        return;
    }
}