mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-13 09:25:15 +08:00
update
This commit is contained in:
@@ -2,13 +2,14 @@
|
||||
|
||||
<p>返回的长度需要从小到大排列。</p>
|
||||
|
||||
<p><strong>示例 1</strong></p>
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><code><strong>输入:</strong>
|
||||
<pre>
|
||||
<code><strong>输入:</strong>
|
||||
shorter = 1
|
||||
longer = 2
|
||||
k = 3
|
||||
<strong>输出:</strong> [3,4,5,6]
|
||||
<strong>输出:</strong>[3,4,5,6]
|
||||
<strong>解释:</strong>
|
||||
可以使用 3 次 shorter,得到结果 3;使用 2 次 shorter 和 1 次 longer,得到结果 4 。以此类推,得到最终结果。</code></pre>
|
||||
|
||||
|
Reference in New Issue
Block a user