LeetCode每日一题(322. Coin Change)

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

You may assume that you have an infinite number of each kind of coin.

Example 1:

Input: coins = [1,2,5], amount = 11
Output: 3

Explanation: 11 = 5 + 5 + 1

Example 2:

Input: coins = [2], amount = 3
Output: -1

Example 3:

Input: coins = [1], amount = 0
Output: 0

Constraints:

• 1 <= coins.length <= 12
• 1 <= coins[i] <= 231 - 1
• 0 <= amount <= 104

---

假设 dp[i]为 amount 为 i 时所需要的最少硬币数， 那 dp[n]=min(dp[n-c1], dp[n-c2], …dp[n-cx]) + 1, 其中 c1,c2,cx 为 coins 里面的硬币面值。 dp[0] = 0, 因为 amount 为 0 时我们不需要任何硬币， 然后遍历计算[1, amount]之间的所有最小硬币数即可

---

impl Solution {
    pub fn coin_change(mut coins: Vec<i32>, amount: i32) -> i32 {
        let mut dp = vec![i32::MAX; amount as usize + 1];
        dp[0] = 0;
        for i in 1..dp.len() as i32 {
            for &c in &coins {
                if i - c >= 0 {
                    let prev = dp[(i - c) as usize];
                    if prev != i32::MAX {
                        dp[i as usize] = dp[i as usize].min(prev + 1)
                    }
                }
            }
        }
        let last = *dp.last().unwrap();
        if last == i32::MAX {
            return -1;
        }
        last
    }
}