代码随想录第四十一天｜动态规划

class Solution {
    public int integerBreak(int n) {
        int[] dp = new int[n+1];
        dp[2] = 1;
        for(int i = 3; i<=n; i++){
            for(int j = 1; j< i-1; j++){
                dp[i] = Math.max(dp[i], Math.max(j *(i-j), j*dp[i-j]));
            }
        }
        return dp[n];
        
    }
}

class Solution {
    public int numTrees(int n) {
        int[] dp = new int[20];
        dp[0] = 1;
        dp[1] = 1;
        dp[2] = 2;

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