mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,10 +3,10 @@
|
||||
<p>Return a <strong>sorted</strong> list of all the integers in the range <code>[low, high]</code> inclusive that have sequential digits.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<pre><strong>Input:</strong> low = 100, high = 300
|
||||
<strong>Output:</strong> [123,234]
|
||||
</pre><p><strong>Example 2:</strong></p>
|
||||
</pre><p><strong class="example">Example 2:</strong></p>
|
||||
<pre><strong>Input:</strong> low = 1000, high = 13000
|
||||
<strong>Output:</strong> [1234,2345,3456,4567,5678,6789,12345]
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user