# LeetCode 0343 - Integer Break

## Contents

# Integer Break

## Desicription

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:**

1 | Input: 2 |

**Example 2:**

1 | Input: 10 |

Note: You may assume that n is not less than 2 and not larger than 58.

## Solution

1 | class Solution { |