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).
这道题考查的是数学能力啊,编程能力考查很小。关键是要知道如果一个数除以3余1,那么这个数分为3+3+3+...+3+4最好
如果除以3余2,那么分成3+3+3+...+3+2最好 能整除3的都分成3+3+3+..+3 如果搞不清楚这个规律,硬做也可以,算法用的是动态规划
public class Solution { public int IntegerBreak(int n) { int i=n%3; int j=n/3; int s=0; if(n==2) { return 1; } else if(i==0&&j==1) { //s=Convert.ToInt32(Math.Pow(3,j)); return 2; } else if(i==0&&j>1) { s=Convert.ToInt32(Math.Pow(3,j)); return s; } else if(i==1) { s=Convert.ToInt32(Math.Pow(3,j-1))*4; return s; } else if (i==2) { s=Convert.ToInt32(Math.Pow(3,j))*2; return s; } else { return 0; } } }