LeetCode322. 零钱兑换

class Solution {
public:
    const int infinity = 10001;
    int coinChange(vector<int>& coins, int amount) {
        sort(coins.begin(), coins.end());
        if (coins[0] > amount && amount != 0)
            return -1;
        vector<unsigned int> dp(amount + 1, infinity);
        dp[0] = 0;
        for (int i = 0; i < coins.size(); i++) {
            for (int j = coins[i]; j <= amount; j++) {
                dp[j] = min(dp[j], dp[j - coins[i]] + 1);
            }
        }
        if (dp[amount] == infinity)
            return -1;
        else
            return dp[amount];
    }
};