0%

### leetcode 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.

• n % 3 == 0:  那么全部拆成3
• n % 3 == 1:  2个2剩下的为3    $$4*3^{(x-1)} > 1*3^x$$
• n % 3 == 2:  1个2剩下的为3

Python 3版本