Update 0343.整数拆分.md

nowsoar · Jun 12, 2023 · 072eb2a · 072eb2a
1 parent 5527410
commit 072eb2a
Showing 1 changed file with 2 additions and 1 deletion.
diff --git 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