Repository navigation
Expand file tree
/
Copy pathLexicographicalNumbers.java
More file actions
65 lines (57 loc) · 1.58 KB
/
Copy pathLexicographicalNumbers.java
File metadata and controls
65 lines (57 loc) · 1.58 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;
public class LexicographicalNumbers {
public static LinkedList<Integer> ret;
public List<Integer> lexicalOrder(int n) {
ret = new LinkedList<>();
for (int i = 1; i <= 9; i++) {
if (i <= n) {
ret.add(i);
dfs(i, n);
}
}
return ret;
}
public static void dfs(int num, int n) {
if (num > n)
return;
for (int i = 0; i <= 9; i++) {
int t = num * 10 + i;
if (t <= n) {
ret.add(t);
dfs(t, n);
} else
break;
}
}
public List<Integer> lexicalOrder1(int n) {
LinkedList<Integer> ret = new LinkedList<>();
Stack<Integer> stack = new Stack<>();
for (int i = n <= 9 ? n : 9; i > 0; i--) {
stack.push(i);
}
while (!stack.isEmpty()) {
int cur = stack.pop();
ret.add(cur);
for (int j = 9; j >= 0; j--) {
int val = cur * 10 + j;
if (val <= n)
stack.push(val);
}
}
return ret;
}
public List<Integer> lexicalOrder2(int n)
{
LinkedList<Integer> list=new LinkedList<>();
String[] vals=new String[n];
for(int i=1;i<=n;i++)
vals[i-1]=String.valueOf(i);
Arrays.sort(vals);
for(String val:vals)
list.add(Integer.valueOf(val));
return list;
}
}