代码随想录算法训练营Day43|贪心算法3

代码随想录算法训练营Day43|贪心算法3

---

---

一、343. 整数拆分

class Solution {
    public int integerBreak(int n) {
        //dp[i] 为正整数 i 拆分后的结果的最大乘积
        int[] dp = new int[n+1];
        dp[2] = 1;
        for(int i = 3; i <= n; i++) {
            for(int j = 1; j <= i-j; j++) {
        
                dp[i] = Math.max(dp[i], Math.max(j*(i-j), j*dp[i-j]));
        
            }
        }
        return dp[n];
    }
}

二、96.不同的二叉搜索树

class Solution {
    public int numTrees(int n) {

        int[] dp = new int[n + 1];
        
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
        
                dp[i] += dp[j - 1] * dp[i - j];
            }
        }
        return dp[n];
    }
}