-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path1291. Sequential Digits.cpp
More file actions
51 lines (31 loc) · 923 Bytes
/
1291. Sequential Digits.cpp
File metadata and controls
51 lines (31 loc) · 923 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
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
class Solution {
public:
vector<int> sequentialDigits(int low, int high) {
vector<int> res;
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)
res.push_back(num);
if(num>high) break;
int d=num%10;
if(d<9){
q.push((num*10)+d+1);
}
}
return res;
}
};