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
use crate::ListNode;
pub struct Solution;
impl Solution {
pub fn delete_node(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
let mut dummy = Some(Box::new(ListNode { next: head, val: 0 }));
let mut node = &mut dummy;
while node.is_some() && node.as_ref().unwrap().next.is_some() {
if node.as_ref().unwrap().next.as_ref().unwrap().val == val {
let n = node.as_mut().unwrap().next.take();
node.as_mut().unwrap().next = n.unwrap().next;
break
}
node = &mut node.as_mut().unwrap().next;
}
dummy.unwrap().next
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::list;
#[test]
fn test() {
let cases = vec![
(vec![4, 1, 9], (list![4, 5, 1, 9], 5)),
(vec![4, 5, 9], (list![4, 5, 1, 9], 1)),
(vec![], (list![], 1)),
(vec![4, 1, 9], (list![4, 1, 9], 3)),
];
for (expect, (head, val)) in cases {
assert_eq!(expect, ListNode::into_vec(Solution::delete_node(head, val)));
}
}
}