问题
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.
Hint:
There is a simple O(n) solution to this problem.
You may check the breaking results of n ranging from 7 to 10 to discover the regularities.
分析
这道题一般会采用动态规划求解,可动态规划一是需要额外空间存储动态数组,二是需要给定初始条件和动态规划规则。
我并没有使用动态规划的思想,二是考虑到,一个数拆分成若干个加数的乘积,这几个加数一定是非常接近的(差得绝对值小于1)。
举个反例,如果 n=a+b+b+b+b 组成,其中 a−b=2 , 那么 a∗b∗b∗b∗b 一定不是最大的,因为 (a−1)(b+1)=ab+(a−b−1)=ab+1>ab 。
所以解题思路为依次把
n
分成
class Solution {
public:
int integerBreak(int n) {
int maxProduct=1;
if(n==1) return 1;
for(int i=2;i<=n;i++){
int divider=n/i;
int remaining=n-divider*(i-1);
if(remaining-divider>1||remaining-divider<-1){
divider++;
remaining=n-divider*(i-1);
}
int product=pow(divider,i-1)*remaining;
if(product>maxProduct){
maxProduct=product;
}
}
return maxProduct;
}
};
时间复杂度为