mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
26 lines
705 B
HTML
26 lines
705 B
HTML
<p>我们定义「顺次数」为：每一位上的数字都比前一位上的数字大 <code>1</code> 的整数。</p>
|
||
|
||
<p>请你返回由 <code>[low, high]</code> 范围内所有顺次数组成的 <strong>有序</strong> 列表（从小到大排序）。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre><strong>输出：</strong>low = 100, high = 300
|
||
<strong>输出：</strong>[123,234]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre><strong>输出：</strong>low = 1000, high = 13000
|
||
<strong>输出：</strong>[1234,2345,3456,4567,5678,6789,12345]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>10 <= low <= high <= 10^9</code></li>
|
||
</ul>
|