1291. Sequential Digits

import java.util.*;
class Solution {
    public List<Integer> sequentialDigits(int low, int high) {
        List<Integer> ans = new ArrayList<>();
        Queue<Integer> queue = new LinkedList<>();
        for (int i = 1; i <= 9; i++) {
            queue.offer(i);
        }
        while (!queue.isEmpty()) {
            int num = queue.poll();
            if (num >= low && num <= high) {
                ans.add(num);
            }
            if (num > high) {
                continue;
            }
            int lastDigit = num % 10;
            if (lastDigit < 9) {
                queue.offer(num * 10 + lastDigit + 1);
            }
        }
        Collections.sort(ans);
        return ans;
    }
}

from collections import deque

class Solution:
    def sequentialDigits(self, low: int, high: int):

        ans = []
        q = deque()

        for i in range(1, 10):
            q.append(i)

        while q:

            num = q.popleft()

            if low <= num <= high:
                ans.append(num)

            if num > high:
                continue

            last = num % 10

            if last < 9:
                q.append(num * 10 + last + 1)

        ans.sort()

        return ans

class Solution {
public:
    vector<int> sequentialDigits(int low, int high) {

        vector<int> ans;
        queue<int> q;

        for (int i = 1; i <= 9; i++) {
            q.push(i);
        }

        while (!q.empty()) {

            int num = q.front();
            q.pop();

            if (num >= low && num <= high) {
                ans.push_back(num);
            }

            if (num > high) {
                continue;
            }

            int lastDigit = num % 10;

            if (lastDigit < 9) {
                q.push(num * 10 + lastDigit + 1);
            }
        }

        sort(ans.begin(), ans.end());

        return ans;
    }
};

var sequentialDigits = function(low, high) {

    const ans = [];
    const queue = [];

    for (let i = 1; i <= 9; i++) {
        queue.push(i);
    }

    while (queue.length) {

        const num = queue.shift();

        if (num >= low && num <= high) {
            ans.push(num);
        }

        if (num > high) {
            continue;
        }

        const lastDigit = num % 10;

        if (lastDigit < 9) {
            queue.push(num * 10 + lastDigit + 1);
        }
    }

    ans.sort((a, b) => a - b);

    return ans;
};