StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
GaoBo 2019-07-25 08:50:01 +08:00
parent d2a04c48b9
commit aa0bb2f210
1 changed files with 0 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
docs/notes/Leetcode 题解 - 动态规划.md
View File

@ -906,9 +906,6 @@ Explanation: there are four ways to make up the amount:
```java ```java
public int change(int amount, int[] coins) { public int change(int amount, int[] coins) {
if (amount == 0 || coins == null || coins.length == 0) {
return 0;
}
int[] dp = new int[amount + 1]; int[] dp = new int[amount + 1];
dp[0] = 1; dp[0] = 1;
for (int coin : coins) { for (int coin : coins) {