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.

分析：
动态规划：

#define max(a,b) (a>b)?a:b;
class Solution {
public:
    int integerBreak(int n) {
        
        vector<int> dp(n+1,0);
        dp[1]=dp[0]=1;
        for(int i=2;i<=n;++i)
        for(int j=1;j<i;++j)
        {int temp=max(i-j,dp[i-j]);dp[i]=max(dp[i],j*temp); }
        return dp[n];
    }
};