g1201_1300.s1291_sequential_digits.readme.md Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

1291\. Sequential Digits

Medium

An 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 in the range `[low, high]` inclusive that have sequential digits.

**Example 1:**

**Input:** low = 100, high = 300

**Output:** [123,234]

**Example 2:**

**Input:** low = 1000, high = 13000

**Output:** [1234,2345,3456,4567,5678,6789,12345]

**Constraints:**

*   `10 <= low <= high <= 10^9`