Merge pull request #752 from gb145234/work

修改leetcode题解动态规划01背包问题第五题
2019-09-15 23:58:44 +08:00 · 2019-09-15 23:58:44 +08:00 · d771c45199
commit d771c45199
parent d6b1948fe9 aa0bb2f210
1 changed files with 0 additions and 3 deletions
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -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) {