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 and not larger than 58.

/*

7 4 3  12
8 3 3 2  18
9 3 3 3  27
10 4 3 3  36
11 2 3 3 3  54
12 3 3 3 3  81 
*/

我们可以从上面的例子看到，只要是大于4的数可以分成3和一个大于1的数相乘则能得到更大的解，也就是让当前数先分成最多的3，然后剩下的如果是4则分成2*2大于3*1，最后就可以得到答案，更加像是一道数学找规律的题。实现的代码如下：

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