sequential-digits

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

An&nbsp;integer has sequential digits if and only if each digit in the number is one more than the previous digit.

Return a sorted list of all the integers&nbsp;in the range <code>[low, high]</code>&nbsp;inclusive that have sequential digits.

&nbsp;
Example 1:
<pre>Input: low = 100, high = 300
Output: [123,234]
</pre>Example 2:
<pre>Input: low = 1000, high = 13000
Output: [1234,2345,3456,4567,5678,6789,12345]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>10 &lt;= low &lt;= high &lt;= 10^9</code></li>
</ul>

sequentialDigits

Sequential Digits

Enumeration

我们定义「顺次数」为：每一位上的数字都比前一位上的数字大 <code>1</code> 的整数。

请你返回由&nbsp;<code>[low, high]</code>&nbsp;范围内所有顺次数组成的 有序 列表（从小到大排序）。

&nbsp;

示例 1：

<pre>输出：low = 100, high = 300
输出：[123,234]
</pre>

示例 2：

<pre>输出：low = 1000, high = 13000
输出：[1234,2345,3456,4567,5678,6789,12345]
</pre>

&nbsp;

提示：

<ul>
	<li><code>10 &lt;= low &lt;= high &lt;= 10^9</code></li>
</ul>