343.整数拆分
题目链接:https://leetcode.cn/problems/integer-break/
class Solution:
def integerBreak(self, n: int) -> int:
dp = [0]*(n+1)
dp[2] = 1
for i in range(3, n+1):
for j in range(1, i//2+1):
dp[i] = max(dp[i], max(j*(i-j),j*dp[i-j]))
return dp[n]
96.不同的二叉树
题目链接:https://leetcode.cn/problems/unique-binary-search-trees/
这道题难想 不画根本做不出来
class Solution:
def numTrees(self, n: int) -> int:
dp = [0]*(n+1)
dp[0], dp[1] = 1, 1
for i in range(2, n+1):
for j in range(1, i+1):
dp[i] += dp[j-1] * dp[i-j]
return dp[n]