题目
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.
解
public class Solution {
public int integerBreak(int n){
if(n == 2) return 1;
if(n == 3) return 2;
int ret = 1;
while( n>4 )
{
ret *= 3;
n -= 3;
}
return ret * n;
}
}
简直就是见过最精妙的解法
拆分到最后的话,可以想见,共有,3+0,3+1,3+2,三种情况:
第一种可以忽略不计;
第三种由于3*2是大于5的,所以,也可以忽略不用考虑的;
第二种由于3*1是小于4的,所以,当最后的余数是4的时候,就可以停止拆分了。
原文链接:http://blog.csdn.net/liyuanbhu/article/details/51198124