> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/343.-integer-break.md).

# 343. 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 and not larger than 58.

Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
      public int integerBreak(int n) {
        if (n <= 1) return -1;

        int[] dp = new int[n+1];
        dp[1] =1;
        dp[2] = 1;

        for(int i = 3; i <= n; i ++) {
            dp[i] = dp[2] * (i-2);
            for(int j = 2; j <= i - 1; j ++) {
                dp[i] = Math.max(dp[i], Math.max(dp[j], j) * Math.max(i-j, dp[i-j]));
            }
        }

        return dp[n];
    }

}
```