<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 fewest number of coins that you need to make up that amount</em>. If that amount of money cannot be made up by any combination of the coins, return <code>-1</code>.</p>

<p>You may assume that you have an infinite number of each kind of coin.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

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

<p><strong class="example">Example 2:</strong></p>

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

<p><strong class="example">Example 3:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= coins.length &lt;= 12</code></li>
	<li><code>1 &lt;= coins[i] &lt;= 2<sup>31</sup> - 1</code></li>
	<li><code>0 &lt;= amount &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    vector<double>dp;
    int helper(vector<int>& coins,int amount,double total){
        if(amount==total){
            return 0;
        }
        if(total>amount){
            return -1;
        }

        if(dp[total]!=-2){
            return dp[total];
        }
        else{
            int ans=INT_MAX;
            for(int i=0;i<coins.size();i++){
                int temp=helper(coins,amount,total+coins[i]);
                if(temp!=-1){
                    ans=min(ans,temp+1);
                }
            }
            if(ans==INT_MAX){
                return dp[total]= (-1);
            }
            return dp[total]=ans;
        }
    }
    int coinChange(vector<int>& coins, double amount) {
        for(int i=0;i<10005;i++){
            dp.push_back(-2);
        }
        int ans=helper(coins,amount,0);
        return ans;
    }
};
64105