algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

优化

Browse Source
This commit is contained in:
Logen
2023-01-28 14:27:57 -06:00
parent 27ba94b581
commit 4b396e1f37
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0322.零钱兑换.md
View File

@ -209,19 +209,19 @@ class Solution:
def coinChange(self, coins: List[int], amount: int) -> int: def coinChange(self, coins: List[int], amount: int) -> int:
'''版本一''' '''版本一'''
# 初始化 # 初始化
dp = [amount + 1]*(amount + 1) dp = [float("inf")]*(amount + 1)
dp[0] = 0 dp[0] = 0
# 遍历物品 # 遍历物品
for coin in coins: for coin in coins:
# 遍历背包 # 遍历背包
for j in range(coin, amount + 1): for j in range(coin, amount + 1):
dp[j] = min(dp[j], dp[j - coin] + 1) dp[j] = min(dp[j], dp[j - coin] + 1)
return dp[amount] if dp[amount] < amount + 1 else -1 return dp[amount] if dp[amount] != float("inf") else -1
def coinChange1(self, coins: List[int], amount: int) -> int: def coinChange1(self, coins: List[int], amount: int) -> int:
'''版本二''' '''版本二'''
# 初始化 # 初始化
dp = [amount + 1]*(amount + 1) dp = [float("inf")]*(amount + 1)
dp[0] = 0 dp[0] = 0
# 遍历物品 # 遍历物品
for j in range(1, amount + 1): for j in range(1, amount + 1):
@ -229,7 +229,7 @@ class Solution:
for coin in coins: for coin in coins:
if j >= coin: if j >= coin:
dp[j] = min(dp[j], dp[j - coin] + 1) dp[j] = min(dp[j], dp[j - coin] + 1)
return dp[amount] if dp[amount] < amount + 1 else -1 return dp[amount] if dp[amount] != float("inf") else -1
``` ```