From 4b396e1f37035796e5407db69d3aa7d74c8ba21b Mon Sep 17 00:00:00 2001
From: Logen <47022821+Logenleedev@users.noreply.github.com>
Date: Sat, 28 Jan 2023 14:27:57 -0600
Subject: [PATCH] =?UTF-8?q?=E4=BC=98=E5=8C=96?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0322.零钱兑换.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/problems/0322.零钱兑换.md b/problems/0322.零钱兑换.md
index 45974112..7505f5ec 100644
--- a/problems/0322.零钱兑换.md
+++ b/problems/0322.零钱兑换.md
@@ -209,19 +209,19 @@ class Solution:
     def coinChange(self, coins: List[int], amount: int) -> int:
         '''版本一'''
         # 初始化
-        dp = [amount + 1]*(amount + 1)
+        dp = [float("inf")]*(amount + 1)
         dp[0] = 0
         # 遍历物品
         for coin in coins:
             # 遍历背包
             for j in range(coin, amount + 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:
         '''版本二'''
         # 初始化
-        dp = [amount + 1]*(amount + 1)
+        dp = [float("inf")]*(amount + 1)
         dp[0] = 0
         # 遍历物品
         for j in range(1, amount + 1):
@@ -229,7 +229,7 @@ class Solution:
             for coin in coins:
                 if j >= coin:
                 	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
 ```