Skip to content

Latest commit

 

History

History
123 lines (49 loc) · 1.29 KB

File metadata and controls

123 lines (49 loc) · 1.29 KB

中文文档

Description

You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.

 

Example 1:

Input: amount = 5, coins = [1, 2, 5]

Output: 4

Explanation: there are four ways to make up the amount:

5=5

5=2+2+1

5=2+1+1+1

5=1+1+1+1+1

Example 2:

Input: amount = 3, coins = [2]

Output: 0

Explanation: the amount of 3 cannot be made up just with coins of 2.

Example 3:

Input: amount = 10, coins = [10] 

Output: 1

 

Note:

You can assume that

    <li>0 &lt;= amount &lt;= 5000</li>
    
    <li>1 &lt;= coin &lt;= 5000</li>
    
    <li>the number of coins is less than 500</li>
    
    <li>the answer is guaranteed to fit into signed 32-bit integer</li>
    

Solutions

Python3

Java

...