Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0301_0400.s0343_integer_break.Solution

```
public class Solution
extends Object
```
343 - Integer Break.
Medium

Given an integer n, break it into the sum of k positive integers , where k >= 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
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int integerBreak(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- integerBreak
```
public int integerBreak(int n)
```