class Solution(object):
def integerBreak(self, n):
"""
:type n: int
:rtype: int
"""
# 1.dp
# n为正整数,那么0不是正整数,1是正整数但是不能拆分,所以从2开始
dp = [0 for _ in range(n+1)]
for i in range(2, n+1):
for j in range(i):
dp[i] = max(dp[i], dp[i-j]*j, (i-j)*j)
return dp[n]
动态规划--LC343.整数拆分
最新推荐文章于 2024-04-25 10:13:59 发布