【Leetcode】Coin Change

发布时间：2020-12-13 21:07:19 所属栏目：PHP教程来源：网络整理

导读：题目链接：https://leetcode.com/problems/coin-change/ 题目： You are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to make up that amount. If t

题目链接：https://leetcode.com/problems/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 ⑴.

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

Example 2:
coins = [2],244)">3
return Note: You may assume that you have an infinite number of each kind of coin.



思路：

c[i]表示数目为i时最少需要多少个硬币。

算法：

public int coinChange(int[] coins,int amount) {  
        int c[] = new int[amount + 1];  
        for (int i = 1; i <= amount; i++) {  
            int min = ⑴;  
            for (int j = 0; j < coins.length; j++) {  
                if (i - coins[j] >= 0 && c[i - coins[j]] != ⑴){  
                    if(min==⑴){//当第1次判断时   
                        min = c[i-coins[j]]+1;  
                    }else{  
                        min = Math.min(min,c[i - coins[j]] + 1);  
                    }  
                }  
            }  
            c[i] = min;  
        }  
        return c[amount] ;  
    }  





   
                        （编辑：李大同）
【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!