更新了leetcode第322题[Coin Change]的cpp代码

Author: junfeng.fj

solution/0300-0399/0322.Coin Change/README.md

@@ -68,4 +68,28 @@ var coinChange = function (coins, amount) {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int coinChange(vector<int>& coins, int amount) {
+        std::vector<int> dp(amount + 1, -1);
+        dp[0] = 0;
+        for (int i = 1; i <= amount; i++) {
+            for (int j = 0; j < coins.size(); j++) {
+                if (coins[j] <= i && dp[i - coins[j]] != -1) {
+                    // 当 当前值未被计算，或者有更小的组成方式的情况下
+                    if (dp[i] == -1 || dp[i] > dp[i - coins[j]] + 1) {
+                        dp[i] = dp[i - coins[j]] + 1;
+                    }
+                }
+            }
+        }
+
+        return dp[amount];
+    }
+};
+```
+
 <!-- tabs:end -->

solution/0300-0399/0322.Coin Change/Solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int coinChange(vector<int>& coins, int amount) {
+        std::vector<int> dp(amount + 1, -1);
+        dp[0] = 0;
+        for (int i = 1; i <= amount; i++) {
+            for (int j = 0; j < coins.size(); j++) {
+                if (coins[j] <= i && dp[i - coins[j]] != -1) {
+                    // 当 当前值未被计算，或者有更小的组成方式的情况下
+                    if (dp[i] == -1 || dp[i] > dp[i - coins[j]] + 1) {
+                        dp[i] = dp[i - coins[j]] + 1;
+                    }
+                }
+            }
+        }
+
+        return dp[amount];
+    }
+};