Package g0501_0600.s0518_coin_change_2

Class Solution

java.lang.Object

g0501_0600.s0518_coin_change_2.Solution

public class Solution
extends Object

518 - Coin Change 2.<p>Medium</p> <p>You are given an integer array <code>coins</code> representing coins of different denominations and an integer <code>amount</code> representing a total amount of money.</p> <p>Return <em>the number of combinations that make up that amount</em>. If that amount of money cannot be made up by any combination of the coins, return <code>0</code>.</p> <p>You may assume that you have an infinite number of each kind of coin.</p> <p>The answer is <strong>guaranteed</strong> to fit into a signed <strong>32-bit</strong> integer.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> amount = 5, coins = [1,2,5]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> 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</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> amount = 3, coins = [2]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> the amount of 3 cannot be made up just with coins of 2.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> amount = 10, coins = [10]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= coins.length <= 300</code></li> <li><code>1 <= coins[i] <= 5000</code></li> <li>All the values of <code>coins</code> are <strong>unique</strong>.</li> <li><code>0 <= amount <= 5000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	change(int amount, int[] coins)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

change

public int change(int amount,
 int[] coins)