322. Coin Change

322. Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute 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.

Example 1: coins = [1, 2, 5], amount = 11 return 3 (11 = 5 + 5 + 1)

Example 2: coins = [2], amount = 3 return -1.

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

class Solution { public int coinChange(int[] coins, int amount) { int[] f = new int[amount + 1]; int n = coins.length; f[0] = 0; int i, j; for (i = 1; i <= amount; ++i) { f[i] = -1; for (j = 0; j < n; ++j) { if (i >= coins[j] && f[i - coins[j]] != -1) { if (f[i] == -1 || f[i - coins[j]] + 1 < f[i]) { f[i] = f[i - coins[j]] + 1; } } } } return

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。