# 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`-1`.

**Example 1:**

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

**Example 2:**

```
Input: 
coins = 
[2]
, amount = 
3
Output: 
-1
```

**Note**:\
You may assume that you have an infinite number of each kind of coin.

分析

01背包，装满背包。p\[0] = 0

```
class Solution(object):
    def coinChange(self, coins, amount):
        """
        :type coins: List[int]
        :type amount: int
        :rtype: int
        """
        p = [float('inf')]*(amount+1)
        p[0] =0
        for i in range(1,amount+1):
            for c in coins:
                if i - c >=0:
                    p[i] = min(p[i],p[i-c]+1)

        return p[amount] if p[amount]!=float('inf') else -1
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nataliekung.gitbook.io/ladder_code/l4dong-tai-gui-hua/coin-change.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.