【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.

class Solution {
public:
    int integerBreak(int n) {
        
        if(n==2){
            return 1;
        }else if(n==3){
            return 2;
        }
        long long product=1;
        int number;
        
        for(number=n;number>4;number-=3){
            product*=3;
        }
        
        product*=number;
        return product;
    }
};

思路心得：

我发现所有的数拆出来都是若干个3的组合是最大的....不知道怎么证明....后略

时间复杂度O(n)空间复杂度O(1)