coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
leetcode-cn/problem (English)/跳水板(English) [diving-board-lcci].html
View File

@@ -1,20 +1,20 @@
<p>You are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length <code>shorter</code> and one of length <code>longer</code>. You must use exactly <code>K</code> planks of wood. Write a method to generate all possible lengths for the diving board.</p>
<p>return all lengths in non-decreasing order.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong>
shorter = 1
longer = 2
k = 3
<strong>Output: </strong> {3,4,5,6}
</pre>
<p><strong>Note: </strong></p>
<ul>
<li>0 &lt; shorter &lt;= longer</li>
<li>0 &lt;= k &lt;= 100000</li>
</ul>
<p>You are building a diving board by placing a bunch of planks of wood end-to-end. There are two types of planks, one of length <code>shorter</code> and one of length <code>longer</code>. You must use exactly <code>K</code> planks of wood. Write a method to generate all possible lengths for the diving board.</p>
<p>return all lengths in non-decreasing order.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong>
shorter = 1
longer = 2