g1201_1300.s1291_sequential_digits.Solution Maven / Gradle / Ivy

Go to download

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

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1201_1300.s1291_sequential_digits;

// #Medium #Enumeration #Udemy_Arrays #2022_03_10_Time_0_ms_(100.00%)_Space_42_MB_(5.03%)

import java.util.ArrayList;
import java.util.List;

/**
 * 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`
**/
public class Solution {
    public List sequentialDigits(int low, int high) {
        int[] arr = {
            12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456,
            4567, 5678, 6789, 12345, 23456, 34567, 45678, 56789, 123456, 234567, 345678, 456789,
            1234567, 2345678, 3456789, 12345678, 23456789, 123456789
        };
        List result = new ArrayList<>();
        for (int j : arr) {
            // 234    148         234        256
            if (j >= low && j <= high) {
                result.add(j);
            }
        }
        return result;
    }
}