Update 0343.整数拆分.md

This commit is contained in:
jianghongcheng
2023-06-12 03:32:07 -05:00
committed by GitHub
parent 5527410f89
commit 072eb2aa47

View File

@ -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