Leetcode:343. Integer Break

题目描述：
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).

Note: you may assume that n is not less than 2.

AC:

public class Solution {
    public int integerBreak(int n) {
        int max=1;
        if(n==1){
            return 1;
        }else if(n==2){
            return 1;
        }else if(n==3){
            return 2;
        }
        while(n>4){
            n=n-3;
            max=3*max;
        }
        return n*max;
    }
}

解法二：
（纯dp）：

令dp[n]为n对应的最大积。

那么递推方程就是：dp[n]=max(i*dp[n-i],i*(n-i))(其中i从1到n-1)。

边界:dp[2]=1;

时间复杂度：O(n2)

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