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

auto commit

Browse Source
This commit is contained in:
CyC2018 2019-09-15 23:59:09 +08:00
commit 366b48d7dd
2 changed files with 12 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -869,22 +869,18 @@ return -1.
```java ```java
public int coinChange(int[] coins, int amount) { public int coinChange(int[] coins, int amount) {
if (amount == 0 || coins == null || coins.length == 0) { public int change(int amount, int[] coins) {
if (coins == null) {
return 0; return 0;
} }
int[] dp = new int[amount + 1]; int[] dp = new int[amount + 1];
dp[0] = 1;
for (int coin : coins) { for (int coin : coins) {
for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历 for (int i = coin; i <= amount; i++) {
if (i == coin) { dp[i] += dp[i - coin];
dp[i] = 1;
} else if (dp[i] == 0 && dp[i - coin] != 0) {
dp[i] = dp[i - coin] + 1;
} else if (dp[i - coin] != 0) {
dp[i] = Math.min(dp[i], dp[i - coin] + 1);
} }
} }
} return dp[amount];
return dp[amount] == 0 ? -1 : dp[amount];
} }
``` ```

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

@ -869,22 +869,18 @@ return -1.
```java ```java
public int coinChange(int[] coins, int amount) { public int coinChange(int[] coins, int amount) {
if (amount == 0 || coins == null || coins.length == 0) { public int change(int amount, int[] coins) {
if (coins == null) {
return 0; return 0;
} }
int[] dp = new int[amount + 1]; int[] dp = new int[amount + 1];
dp[0] = 1;
for (int coin : coins) { for (int coin : coins) {
for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历 for (int i = coin; i <= amount; i++) {
if (i == coin) { dp[i] += dp[i - coin];
dp[i] = 1;
} else if (dp[i] == 0 && dp[i - coin] != 0) {
dp[i] = dp[i - coin] + 1;
} else if (dp[i - coin] != 0) {
dp[i] = Math.min(dp[i], dp[i - coin] + 1);
} }
} }
} return dp[amount];
return dp[amount] == 0 ? -1 : dp[amount];
} }
``` ```