这可能是LeetCode最简单的中等题了
class Solution {
public int integerBreak(int n) {
// 将最小的问题拆分成1,2,3
if(n == 1)
return 0;
else if ( n == 2)
return 1;
else if (n == 3)
return 2;
int a = 1;
while (n > 4) {
n = n - 3;
a = a * 3;
}
return a * n;
}
}