代码随想录-动态规划（343. 整数拆分、96. 不同的二叉搜索树）

343. 整数拆分

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

        }
        return dp[n];
    }
};

96. 不同的二叉搜索树

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