auto commit

CyC2018 · CyC2018 · commit ae7fd87fc0d7 · 2020-11-02T00:58:34.000+08:00
diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md
@@ -912,6 +912,7 @@ return -1.
 
 ```java
 public int coinChange(int[] coins, int amount) {
+    if (amount == 0 || coins == null) return 0;
     int[] dp = new int[amount + 1];
     for (int coin : coins) {
         for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历
diff --git a/notes/Leetcode 题解 - 动态规划.md b/notes/Leetcode 题解 - 动态规划.md
@@ -912,6 +912,7 @@ return -1.
 
 ```java
 public int coinChange(int[] coins, int amount) {
+    if (amount == 0 || coins == null) return 0;
     int[] dp = new int[amount + 1];
     for (int coin : coins) {
         for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历
