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.
Example 1:
Input: 2
Output: 1
Explanation: 2 = 1 + 1, 1 × 1 = 1.
Example 2:
Input: 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.
Note: You may assume that n is not less than 2 and not larger than 58.
题意:怎样将一个数拆分成若干个数的和,然后这些数相乘的积最大。
思路:
网上学到的:经过数学公式的推论,将数拆分成若干个2和3时,他们相乘的积最大,并且用两个3代替三个2.(2*2*2<3*3)。
代码 :
class Solution {
public int integerBreak(int n) {
if(n<2)
return 0;
if(n==2)
return 1;
if(n==3)
return 2;
int result =1;
while(n>4){
//将数尽可能多地拆分成3
result *= 3;
n -= 3;
}
result *= n; //到最后n只能为2、3、4(2*2)
return result;
}
}