From 072eb2aa471f025afdb690e57a23c0932b5a4697 Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Mon, 12 Jun 2023 03:32:07 -0500
Subject: [PATCH] =?UTF-8?q?Update=200343.=E6=95=B4=E6=95=B0=E6=8B=86?=
 =?UTF-8?q?=E5=88=86.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0343.整数拆分.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/problems/0343.整数拆分.md b/problems/0343.整数拆分.md
index d70641db..3ff8dedb 100644
--- a/problems/0343.整数拆分.md
+++ b/problems/0343.整数拆分.md
@@ -262,10 +262,11 @@ class Solution:
 
                 # 计算切割点j和剩余部分(i-j)的乘积，并与之前的结果进行比较取较大值
                 
-                dp[i] = max(dp[i], max((i - j) * j, dp[i - j] * j))
+                dp[i] = max(dp[i], (i - j) * j, dp[i - j] * j)
         
         return dp[n]  # 返回最终的计算结果
 
+
 ```
 动态规划（版本二）
 ```python