0518 chnage

Author: aouos

README.md

@@ -71,6 +71,7 @@
 | 0509 | [fib](./code/0509_fib) | ⭐ | Array |  |
 | 0513 | [findBottomLeftValue](./code/0513_findBottomLeftValue) | ⭐⭐ | DFS, BFS, Tree |  |
 | 0514 | [findRotateSteps](./code/0514_findRotateSteps) | ⭐⭐⭐ | DFS, DP |  |
+| 0518 | [change](./code/0518_change) | ⭐⭐ | DP | 1️⃣ |
 | 0547 | [findCircleNum](./code/0547_findCircleNum) | ⭐⭐ | DFS, UN |  |
 | 0605 | [canPlaceFlowers](./code/0605_canPlaceFlowers) | ⭐ | Greedy |  |
 | 0628 | [maximumProduct](./code/0628_maximumProduct) | ⭐ | Array |  |

code/0076_minWindow/minWindow-sliderwindow.js

@@ -40,6 +40,4 @@ var minWindow = function (s, t) {
     return '';
   }
   return s.substring(start, start + minLen);
-};
-
-console.log(minWindow("a", "a"));
+};

code/0518_change/change-dp.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number} amount
+ * @param {number[]} coins
+ * @return {number}
+ */
+ var change = function(amount, coins) {
+  if (amount === 0) return 1;
+  const dp = [1].concat(new Array(amount).fill(0));
+
+  for (let c = 0; c < coins.length; c++) {
+    for (let i = 1; i <= amount; i++) {
+      if (i - coins[c] >= 0) {
+        dp[i] = dp[i] + dp[i - coins[c]];
+      }
+    }
+  }
+
+  return dp[dp.length - 1];
+};
+
+// 时间复杂度 O(M*N) N为amount长度，M为coins个数
+// 空间复杂度 O(N) N为amount长度