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.
Example 1:
Input: 2
Output: 1
Explanation: 2 = 1 + 1, 1 × 1 = 1.
Example 2:
Input: 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.
Note: You may assume that n is not less than 2 and not larger than 58.
Accepted
68,865
Submissions
146,836
class Solution:
def integerBreak(self, n):
"""
:type n: int
:rtype: int
"""
if n==2:
return 1
if n==3:
return 2
if n==4:
return 4
dp = [2,3,4]
for i in range(5,n+1):
# print(i)
dp.append(max(dp[-1],dp[-2]*2,dp[-3]*3))
# print(dp)
return dp[-1]