Leetcode Solution - 322. Coin Change

CoinChange.cs

public class Solution
{
    public int CoinChange(int[] coins, int amount)
    {
        int[] dp = new int[amount + 1];
        Array.Fill(dp, amount + 1);


        dp[0] = 0;
        for (int i = 0; i <= amount; ++i)
            foreach (int coin in coins)
            {
                if (i - coin < 0) continue;

                dp[i] = Math.Min(dp[i], dp[i - coin] + 1);
            }

        if (dp[amount] == amount + 1) return -1;
        return dp[amount];
    }
}

322. Coin Change

You are given an integer array coins representing coins of different denominations and an integer amount 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 -1.
You may assume that you have an infinite number of each kind of coin.

Example 1:
Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

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

Example 3:
Input: coins = [1], amount = 0
Output: 0

Constraints:
1 <= coins.length <= 12
1 <= coins[i] <= 231 - 1
0 <= amount <= 104

https://leetcode.com/problems/coin-change/

Result

Runtime: 138 ms, faster than 67.56% of C# online submissions for Coin Change.
Memory Usage: 39.1 MB, less than 96.61% of C# online submissions for Coin Change.