yys130826的博客

class Solution: def numTrees(self, n: int) -> int: dp=[0]*(n+1) dp[0]=1 for i in range(1,n+1): for j in range(1,i+1): dp[i]+=dp[i-j]*dp[j-1] return dp[-1] '''dp[3]，就是 元素1为头结点搜索树的数量+元素2为头结点.

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): dp[i]=max(dp[i],max((j*(i-j),dp[i-j]*j))) return dp[n] '''简单理解为，.