# 代码随想录训练营第III期--041--python
# 343. 整数拆分
class Solution:
def integerbreak(self, n):
# dp = [[0] for _ in range(n+1)] # 参数传递
dp = [0] * (n+1)
for i in range(2,n+1):
for j in range(i):
dp[i] = max(dp[i], j*(i-j), j*dp[i-j])
return dp[n]
sl = Solution()
n = 2
print(sl.integerbreak(n))
# 96.不同的二叉搜索树
# 不会,收藏了,以后再说
class Solution:
def numTrees(self,n):
dp = [0] * (n+1)
dp[0] = 1
for i in range(1,n+1):
for j in range(1, i+1):
dp[i] += dp[j-1] * dp[i-j]
return dp[n]
代码随想录训练营第III期--041--python
最新推荐文章于 2024-07-23 14:36:35 发布