coin-change-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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.

Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return <code>0</code>.

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

The answer is guaranteed to fit into a signed 32-bit integer.

&nbsp;
Example 1:

<pre>
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
</pre>

Example 2:

<pre>
Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.
</pre>

Example 3:

<pre>
Input: amount = 10, coins = [10]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= coins.length &lt;= 300</code></li>
	<li><code>1 &lt;= coins[i] &lt;= 5000</code></li>
	<li>All the values of <code>coins</code> are unique.</li>
	<li><code>0 &lt;= amount &lt;= 5000</code></li>
</ul>

change

Coin Change II

Maximum Value of K Coins From Piles

maximum-value-of-k-coins-from-piles

从栈中取出 K 个硬币的最大面值和

Number of Ways to Earn Points

number-of-ways-to-earn-points

获得分数的方法数

Count of Sub-Multisets With Bounded Sum

count-of-sub-multisets-with-bounded-sum

和带限制的子多重集合的数目

Length of the Longest Subsequence That Sums to Target

length-of-the-longest-subsequence-that-sums-to-target

和为目标值的最长子序列的长度

The Number of Ways to Make the Sum

the-number-of-ways-to-make-the-sum

达到总和的方法数量

Array

Dynamic Programming

给你一个整数数组 <code>coins</code> 表示不同面额的硬币，另给一个整数 <code>amount</code> 表示总金额。

请你计算并返回可以凑成总金额的硬币组合数。如果任何硬币组合都无法凑出总金额，返回 <code>0</code> 。

假设每一种面额的硬币有无限个。 

题目数据保证结果符合 32 位带符号整数。

 

<ul>
</ul>

示例 1：

<pre>
输入：amount = 5, coins = [1, 2, 5]
输出：4
解释：有四种方式可以凑成总金额：
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1
</pre>

示例 2：

<pre>
输入：amount = 3, coins = [2]
输出：0
解释：只用面额 2 的硬币不能凑成总金额 3 。
</pre>

示例 3：

<pre>
输入：amount = 10, coins = [10] 
输出：1
</pre>

 

提示：

<ul>
	<li><code>1 <= coins.length <= 300</code></li>
	<li><code>1 <= coins[i] <= 5000</code></li>
	<li><code>coins</code> 中的所有值 互不相同</li>
	<li><code>0 <= amount <= 5000</code></li>
</ul>