# 343. Integer Break

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 and not larger than 58.

Hint:

1. There is a simple O(n) solution to this problem.
2. You may check the breaking results of n ranging from 7 to 10 to discover the regularities.

	2 - 1,1
3 - 1,2
4 - 2,2
5 - 3,2
6 - 3,3
7 - 3,4
8 - 3,3,2
9 - 3,3,3
10 - 3,3,4
11 - 3,3,3,2
12 - 3,3,3,3
13 - 3,3,3,4

I saw many solutions were referring to factors of 2 and 3. But why these two magic numbers? Why other factors do not work?
Let's study the math behind it.

For convenience, say n is sufficiently large and can be broken into any smaller real positive numbers. We now try to calculate which real number generates the largest product.
Assume we break n into (n / x) x's, then the product will be xn/x, and we want to maximize it.

Taking its derivative gives us n * xn/x-2 * (1 - ln(x)).
The derivative is positive when 0 < x < e, and equal to 0 when x = e, then becomes negative when x > e,
which indicates that the product increases as x increases, then reaches its maximum when x = e, then starts dropping.

This reveals the fact that if n is sufficiently large and we are allowed to break n into real numbers,
the best idea is to break it into nearly all e's.
On the other hand, if n is sufficiently large and we can only break n into integers, we should choose integers that are closer to e.
The only potential candidates are 2 and 3 since 2 < e < 3, but we will generally prefer 3 to 2. Why?

Of course, one can prove it based on the formula above, but there is a more natural way shown as follows.

6 = 2 + 2 + 2 = 3 + 3. But 2 * 2 * 2 < 3 * 3.
Therefore, if there are three 2's in the decomposition, we can replace them by two 3's to gain a larger product.

All the analysis above assumes n is significantly large. When n is small (say n <= 10), it may contain flaws.
For instance, when n = 4, we have 2 * 2 > 3 * 1.
To fix it, we keep breaking n into 3's until n gets smaller than 10, then solve the problem by brute-force.

class Solution {
public:
int integerBreak(int n) {
if (n==2)
return 1;
if (n==3)
return 2;
if (n%3 == 0)
{
return pow(3,n/3);
}
if (n%3 == 2)
{
return pow(3,n/3)*2;
}
return pow(3,(n/3)-1)*4;

}
};

• 本文已收录于以下专栏：

## LeetCode 第 343 题 (Integer Break)

LeetCode 第 343 题 (Integer Break) Given a positive integer n, break it into the sum of at least tw...
• liyuanbhu
• 2016年04月20日 09:48
• 6072

## 【Leetcode】：343. Integer Break 问题 in JAVA

Given a positive integer n, break it into the sum of at least two positive integers and maximize the...
• u013564276
• 2016年04月20日 21:11
• 713

## LeetCode 343. Integer Break（整数分拆）

• jmspan
• 2016年04月30日 12:00
• 622

## Leetcode Integer Break 343

Given a positive integer n, break it into the sum of at least two positive integers and maximize the...
• huaxixidongbeishida
• 2016年12月27日 21:00
• 182

## leetcode343-Integer Break(整数拆分求最大乘积)

• will130
• 2016年04月19日 20:32
• 2460

## Leetcode-343_Integer Break(整数分解) -动态规划解法-Leetcode大神解法-整体运行代码

Leetcode-343Integer Break(整数分解) Given a positive integer n, break it into the sum of at least two...
• qq_34202873
• 2018年02月08日 17:51
• 35

## [LeetCode]Integer Break

Integer Break Given a positive integer n, break it into the sum of at least two positive intege...
• CiaoLiang
• 2016年04月19日 14:54
• 656

## [343]Integer Break

【题目描述】 Given a positive integer n, break it into the sum of at least two positive integers and ...
• 2016年09月05日 15:49
• 90

## 343. Integer Break 等

343. Integer Break 原题： Given a positive integer n, break it into the sum of at least two positi...
• Mr_Zing
• 2016年10月23日 11:26
• 298

## LeetCode 343. Integer Break

• sinat_36053757
• 2017年08月12日 21:30
• 92

举报原因： 您举报文章：343. Integer Break 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)