mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
18 lines
600 B
HTML
18 lines
600 B
HTML
<p>现需要将一根长为正整数 <code>bamboo_len</code> 的竹子砍为若干段，每段长度均为正整数。请返回每段竹子长度的最大乘积是多少。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入: </strong>bamboo_len<strong> </strong>=<strong> </strong>12
|
||
<strong>输出: </strong>81
|
||
</pre>
|
||
<strong>提示：</strong>
|
||
|
||
<ul>
|
||
<li><code>2 <= bamboo_len <= 58</code></li>
|
||
</ul>
|
||
|
||
<p>注意：本题与主站 343 题相同：<a href="https://leetcode-cn.com/problems/integer-break/">https://leetcode-cn.com/problems/integer-break/</a></p>
|