-
Notifications
You must be signed in to change notification settings - Fork 0
/
middle-of-the-linked-list.rs
82 lines (76 loc) · 2.04 KB
/
middle-of-the-linked-list.rs
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
struct Solution;
// Definition for singly-linked list.
#[derive(PartialEq, Eq, Clone, Debug)]
pub struct ListNode {
pub val: i32,
pub next: Option<Box<ListNode>>,
}
impl ListNode {
#[allow(unused)]
#[inline]
fn new(val: i32) -> Self {
ListNode { next: None, val }
}
}
impl Solution {
pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
let (mut fast, mut slow) = (&head.clone(), head);
loop {
if let Some(ref node) = fast {
if let Some(ref next) = node.next {
fast = &next.next;
slow = slow.unwrap().next;
continue;
}
}
break;
}
slow
}
}
fn main() {
let head = Some(Box::new(ListNode {
val: 1,
next: Some(Box::new(ListNode {
val: 2,
next: Some(Box::new(ListNode {
val: 3,
next: Some(Box::new(ListNode {
val: 4,
next: Some(Box::new(ListNode { val: 5, next: None })),
})),
})),
})),
}));
println!("{:?}", Solution::middle_node(head));
}
#[cfg(test)]
mod tests {
use crate::{ListNode, Solution};
#[test]
fn test() {
let head = Some(Box::new(ListNode {
val: 1,
next: Some(Box::new(ListNode {
val: 2,
next: Some(Box::new(ListNode {
val: 3,
next: Some(Box::new(ListNode {
val: 4,
next: Some(Box::new(ListNode { val: 5, next: None })),
})),
})),
})),
}));
assert_eq!(
Solution::middle_node(head),
Some(Box::new(ListNode {
val: 3,
next: Some(Box::new(ListNode {
val: 4,
next: Some(Box::new(ListNode { val: 5, next: None })),
})),
}))
);
}
}