Package g0301_0400.s0343_integer_break
Class Solution
-
- All Implemented Interfaces:
public final class Solution
343 - Integer Break.
Medium
Given an integer
n
, break it into the sum ofk
positive integers , wherek >= 2
, and maximize the product of those integers.Return the maximum product you can get.
Example 1:
Input: n = 2
Output: 1
Explanation: 2 = 1 + 1, 1 × 1 = 1.
Example 2:
Input: n = 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.
Constraints:
2 <= n <= 58
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
integerBreak(Integer n)
-
-
Method Detail
-
integerBreak
final Integer integerBreak(Integer n)
-
-
-
-