coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 02:41:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 18:53:53 +08:00
parent c9b1bf36a8
commit 9bc4722a45
349 changed files with 15897 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
leetcode-cn/problem (Chinese)/砍竹子 I [jian-sheng-zi-lcof].html Normal file
View File

@@ -0,0 +1,17 @@
<p>现需要将一根长为正整数 <code>bamboo_len</code> 的竹子砍为若干段，每段长度均为正整数。请返回每段竹子长度的最大乘积是多少。</p>
<p>&nbsp;</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 &lt;= bamboo_len&nbsp;&lt;= 58</code></li>
</ul>
<p>注意：本题与主站 343 题相同：<a href="https://leetcode-cn.com/problems/integer-break/">https://leetcode-cn.com/problems/integer-break/</a></p>