＜Talk is cheap, show me the code 16＞ LeetCode.322 零钱兑换

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        /*
        dp[j] : 在所有coins中可放回的选择，凑成总金额为 j 所需的最少硬币数
        dp[j] = min(dp[j], dp[j - coins[i]] + 1);
        */
        if(amount == 0) return 0;
        vector<int> dp(10001, INT_MAX); //最多用amount枚硬币
        dp[0] = 0;
        int mincoin = INT_MAX;
        for(int j = 1; j <= amount; j ++){
            for(int i = 0; i < coins.size(); i ++){
                if(j >= coins[i] && dp[j - coins[i]] != INT_MAX) //跳过初始值，即从刚好选择该coins[i]开始更新dp
                    dp[j] = min(dp[j], dp[j - coins[i]] + 1); 
            }
        }
        if(dp[amount] == INT_MAX) return -1; //说明没有更新过dp[amount]，即一个硬币都没有选
        return dp[amount];
    }
};