Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1201_1300.s1291_sequential_digits.Solution

```
public class Solution
extends Object
```
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

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<Integer> sequentialDigits(int low, int high)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

sequentialDigits

public List<Integer> sequentialDigits(int low,
                                      int high)