修改leetcode题解动态规划01背包问题第五题

MurphyBrandonGao · MurphyBrandonGao · commit aa0bb2f210a2 · 2019-07-25T08:50:01.000+08:00
diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md
@@ -906,9 +906,6 @@ Explanation: there are four ways to make up the amount:
 
 ```java
 public int change(int amount, int[] coins) {
-    if (amount == 0 || coins == null || coins.length == 0) {
-        return 0;
-    }
     int[] dp = new int[amount + 1];
     dp[0] = 1;
     for (int coin : coins) {
