mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Update 0343.整数拆分.md
This commit is contained in:
@ -262,10 +262,11 @@ class Solution:
|
|||||||
|
|
||||||
# 计算切割点j和剩余部分(i-j)的乘积,并与之前的结果进行比较取较大值
|
# 计算切割点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] # 返回最终的计算结果
|
return dp[n] # 返回最终的计算结果
|
||||||
|
|
||||||
|
|
||||||
```
|
```
|
||||||
动态规划(版本二)
|
动态规划(版本二)
|
||||||
```python
|
```python
|
||||||
|
Reference in New Issue
Block a user