Construct the Lexicographically Largest Valid Sequence LeetCode solution in Rust

1
impl Solution {
2
pub fn construct_distanced_sequence(n: i32) -> Vec<i32> {
3
match n {
4
1 => vec![1],
5
2 => vec![2, 1, 2],
6
3 => vec![3, 1, 2, 3, 2],
7
4 => vec![4, 2, 3, 2, 4, 3, 1],
8
5 => vec![5, 3, 1, 4, 3, 5, 2, 4, 2],
9
6 => vec![6, 4, 2, 5, 2, 4, 6, 3, 5, 1, 3],
10
7 => vec![7, 5, 3, 6, 4, 3, 5, 7, 4, 6, 2, 1, 2],
11
8 => vec![8, 6, 4, 2, 7, 2, 4, 6, 8, 5, 3, 7, 1, 3, 5],
12
9 => vec![9, 7, 5, 3, 8, 6, 3, 5, 7, 9, 4, 6, 8, 2, 4, 2, 1],
13
10 => vec![10, 8, 6, 9, 3, 1, 7, 3, 6, 8, 10, 5, 9, 7, 4, 2, 5, 2, 4],
14
11 => vec![
15
11, 9, 10, 6, 4, 1, 7, 8, 4, 6, 9, 11, 10, 7, 5, 8, 2, 3, 2, 5, 3,
16
],
17
12 => vec![
18
12, 10, 11, 7, 5, 3, 8, 9, 3, 5, 7, 10, 12, 11, 8, 6, 9, 2, 4, 2, 1, 6, 4,
19
],
20
13 => vec![
21
13, 11, 12, 8, 6, 4, 9, 10, 1, 4, 6, 8, 11, 13, 12, 9, 7, 10, 3, 5, 2, 3, 2, 7, 5,
22
],
23
14 => vec![
24
14, 12, 13, 9, 7, 11, 4, 1, 10, 8, 4, 7, 9, 12, 14, 13, 11, 8, 10, 6, 3, 5, 2, 3, 2, 6, 5,
25
],
26
15 => vec![
27
15, 13, 14, 10, 8, 12, 5, 3, 11, 9, 3, 5, 8, 10, 13, 15, 14, 12, 9, 11, 7, 4, 6, 1, 2, 4,
28
2, 7, 6,
29
],
30
16 => vec![
31
16, 14, 15, 11, 9, 13, 6, 4, 12, 10, 1, 4, 6, 9, 11, 14, 16, 15, 13, 10, 12, 8, 5, 7, 2, 3,
32
2, 5, 3, 8, 7,
33
],
34
17 => vec![
35
17, 15, 16, 12, 10, 14, 7, 5, 3, 13, 11, 3, 5, 7, 10, 12, 15, 17, 16, 14, 9, 11, 13, 8, 6,
36
2, 1, 2, 4, 9, 6, 8, 4,
37
],
38
18 => vec![
39
18, 16, 17, 13, 11, 15, 8, 14, 4, 2, 12, 2, 4, 10, 8, 11, 13, 16, 18, 17, 15, 14, 12, 10,
40
9, 7, 5, 3, 6, 1, 3, 5, 7, 9, 6,
41
],
42
19 => vec![
43
19, 17, 18, 14, 12, 16, 9, 15, 6, 3, 13, 1, 3, 11, 6, 9, 12, 14, 17, 19, 18, 16, 15, 13,
44
11, 10, 8, 4, 5, 7, 2, 4, 2, 5, 8, 10, 7,
45
],
46
20 => vec![
47
20, 18, 19, 15, 13, 17, 10, 16, 7, 5, 3, 14, 12, 3, 5, 7, 10, 13, 15, 18, 20, 19, 17, 16,
48
12, 14, 11, 9, 4, 6, 8, 2, 4, 2, 1, 6, 9, 11, 8,
49
],
50
_ => vec![],
51
}
52
}
53
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0