integer-break

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer <code>n</code>, break it into the sum of <code>k</code> positive integers, where <code>k &gt;= 2</code>, and maximize the product of those integers.

Return the maximum product you can get.

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: 1
Explanation: 2 = 1 + 1, 1 &times; 1 = 1.
</pre>

Example 2:

<pre>
Input: n = 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 &times; 3 &times; 4 = 36.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= n &lt;= 58</code></li>
</ul>

integerBreak

Integer Break

Maximize Number of Nice Divisors

maximize-number-of-nice-divisors

好因子的最大数目

Math

Dynamic Programming

给定一个正整数&nbsp;<code>n</code>&nbsp;，将其拆分为 <code>k</code> 个 正整数 的和（&nbsp;<code>k &gt;= 2</code>&nbsp;），并使这些整数的乘积最大化。

返回 你可以获得的最大乘积&nbsp;。

&nbsp;

示例 1:

<pre>
输入: n = 2
输出: 1
解释: 2 = 1 + 1, 1 × 1 = 1。</pre>

示例&nbsp;2:

<pre>
输入: n = 10
输出: 36
解释: 10 = 3 + 3 + 4, 3 ×&nbsp;3 ×&nbsp;4 = 36。</pre>

&nbsp;

提示:

<ul>
	<li><code>2 &lt;= n &lt;= 58</code></li>
</ul>