coin-change

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 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 <code>-1</code>.

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

&nbsp;
Example 1:

<pre>
Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1
</pre>

Example 2:

<pre>
Input: coins = [2], amount = 3
Output: -1
</pre>

Example 3:

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

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= coins.length &lt;= 12</code></li>
	<li><code>1 &lt;= coins[i] &lt;= 231 - 1</code></li>
	<li><code>0 &lt;= amount &lt;= 104</code></li>
</ul>

coinChange

Coin Change

Minimum Cost For Tickets

minimum-cost-for-tickets

最低票价

Maximum Value of K Coins From Piles

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

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

Minimum Number of Operations to Convert Time

minimum-number-of-operations-to-convert-time

转化时间需要的最少操作数

Minimum Cost to Split an Array

minimum-cost-to-split-an-array

拆分数组的最小代价

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

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

Minimum Number of Coins to be Added

minimum-number-of-coins-to-be-added

需要添加的硬币的最小数量

Most Expensive Item That Can Not Be Bought

most-expensive-item-that-can-not-be-bought

最贵的无法购买的商品

Breadth-First Search

Array

Dynamic Programming

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

计算并返回可以凑成总金额所需的 最少的硬币个数 。如果没有任何一种硬币组合能组成总金额，返回&nbsp;<code>-1</code> 。

你可以认为每种硬币的数量是无限的。

&nbsp;

示例&nbsp;1：

<pre>
输入：coins = <code>[1, 2, 5]</code>, amount = <code>11</code>
输出：<code>3</code> 
解释：11 = 5 + 5 + 1</pre>

示例 2：

<pre>
输入：coins = <code>[2]</code>, amount = <code>3</code>
输出：-1</pre>

示例 3：

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

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= coins.length &lt;= 12</code></li>
	<li><code>1 &lt;= coins[i] &lt;= 231 - 1</code></li>
	<li><code>0 &lt;= amount &lt;= 104</code></li>
</ul>