algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-05 16:17:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2020-11-02 00:58:34 +08:00
parent a9d58b91de
commit ae7fd87fc0
2 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -912,6 +912,7 @@ return -1.
```java ```java
public int coinChange(int[] coins, int amount) { public int coinChange(int[] coins, int amount) {
if (amount == 0 || coins == null) return 0;
int[] dp = new int[amount + 1]; int[] dp = new int[amount + 1];
for (int coin : coins) { for (int coin : coins) {
for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历 for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历

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

@ -912,6 +912,7 @@ return -1.
```java ```java
public int coinChange(int[] coins, int amount) { public int coinChange(int[] coins, int amount) {
if (amount == 0 || coins == null) return 0;
int[] dp = new int[amount + 1]; int[] dp = new int[amount + 1];
for (int coin : coins) { for (int coin : coins) {
for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历 for (int i = coin; i <= amount; i++) { //将逆序遍历改为正序遍历