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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
#[derive(PartialEq, Eq, Clone, Debug)]
pub struct ListNode {
pub val: i32,
pub next: Option<Box<ListNode>>
}
//
impl ListNode {
#[inline]
pub fn new(val: i32) -> Self {
ListNode {
next: None,
val
}
}
}
pub fn vector2list(vec: Vec<i32>) -> Option<Box<ListNode>> {
let mut result: Option<Box<ListNode>> = None;
for i in 0..vec.len() {
let mut new_result = Some(Box::new(ListNode::new(vec[vec.len() - i - 1])));
new_result.as_mut().unwrap().next = result;
result = new_result;
}
result
}
pub fn list2vector(lst: Option<Box<ListNode>>) -> Vec<i32> {
let mut result: Vec<i32> = Vec::new();
let mut cur = &lst;
loop {
match cur {
None => break,
Some(node) => {
result.push(node.val);
cur = &node.next;
},
}
}
result
}
impl Solution {
pub fn merge_two_lists(list1: Option<Box<ListNode>>, list2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
let mut p1 = &list1;
let mut p2 = &list2;
let mut result: Vec<i32> = vec!();
loop {
let v1: i32;
let v2: i32;
match p1 {
None => {
match p2 {
None => break,
Some(px) => {
result.push(px.val);
p2 = &px.next;
continue;
}
}
},
Some(p1) => { v1 = p1.val; },
}
match p2 {
None => {
match p1 {
None => break,
Some(px) => {
result.push(px.val);
p1 = &px.next;
continue;
}
}
},
Some(p2) => { v2 = p2.val; },
}
if v1 <= v2 {
result.push(v1);
p1 = match p1 {
Some(px) => &px.next,
None => p1,
};
} else {
result.push(v2);
p2 = match p2 {
Some(px) => &px.next,
None => p2,
};
}
}
vector2list(result)
}
}
struct Solution {}
fn main() {
println!("{:?}", list2vector(
Solution::merge_two_lists(vector2list(vec!(1,3,5)),
vector2list(vec!(2,4,6)))));
}
|
