343. 整数拆分

        

class Solution {
public:int integerBreak(int n) {vector<int> f(n+1,0);f[2]=1;for(int i=3;i<=n;i++){for(int j=1;j<i-1;j++){f[i]=max(f[i],max(f[i-j]*j,(i-j)*j));}}return f[n];}
};

       96. 不同的二叉搜索树

class Solution {
public:int numTrees(int n) {vector<int> f(n+1,0);f[0]=1;for(int i=1;i<=n;i++){for(int j=1;j<=i;j++){f[i] += f[j-1]*f[i-j];}}return f[n];}
};