algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-05 21:19:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

A few bug fixes.

Browse Source
This commit is contained in:
krahets
2023-11-03 22:48:43 +08:00
parent 6c16276494
commit 5f3ad1ed3d
26 changed files with 52 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/python/chapter_dynamic_programming/coin_change.py
View File

@ -18,7 +18,7 @@ def coin_change_dp(coins: list[int], amt: int) -> int:
for i in range(1, n + 1):
for a in range(1, amt + 1):
if coins[i - 1] > a:
# 若超过背包容量，则不选硬币 i
# 若超过目标金额，则不选硬币 i
dp[i][a] = dp[i - 1][a]
else:
# 不选和选硬币 i 这两种方案的较小值
@ -38,7 +38,7 @@ def coin_change_dp_comp(coins: list[int], amt: int) -> int:
# 正序遍历
for a in range(1, amt + 1):
if coins[i - 1] > a:
# 若超过背包容量，则不选硬币 i
# 若超过目标金额，则不选硬币 i
dp[a] = dp[a]
else:
# 不选和选硬币 i 这两种方案的较小值

4
codes/python/chapter_dynamic_programming/coin_change_ii.py
View File

@ -17,7 +17,7 @@ def coin_change_ii_dp(coins: list[int], amt: int) -> int:
for i in range(1, n + 1):
for a in range(1, amt + 1):
if coins[i - 1] > a:
# 若超过背包容量，则不选硬币 i
# 若超过目标金额，则不选硬币 i
dp[i][a] = dp[i - 1][a]
else:
# 不选和选硬币 i 这两种方案之和
@ -36,7 +36,7 @@ def coin_change_ii_dp_comp(coins: list[int], amt: int) -> int:
# 正序遍历
for a in range(1, amt + 1):
if coins[i - 1] > a:
# 若超过背包容量，则不选硬币 i
# 若超过目标金额，则不选硬币 i
dp[a] = dp[a]
else:
# 不选和选硬币 i 这两种方案之和