remove-nodes-from-linked-list.rs

#![allow(dead_code, unused, unused_variables, non_snake_case)]

fnmain(){}

structSolution;

// Definition for singly-linked list.
#[derive(PartialEq,Eq,Clone,Debug)]
pubstructListNode{
pubval:i32,
pubnext:Option<Box<ListNode>>,
}

implListNode{
#[inline]
fnnew(val:i32) -> Self{
ListNode{next:None, val }
}
}

implSolution{
pubfnremove_nodes(head:Option<Box<ListNode>>) -> Option<Box<ListNode>>{
letmut head = head;
letmut stack = vec![];
whileletSome(mut x) = head.take(){
whileletSome(m) = stack.pop(){
if m >= x.val{
 stack.push(m);
break;
}
}
 stack.push(x.val);
 head = x.next.take();
}

letmut pre_head = ListNode{val:0,next:None};
letmut current = &mut pre_head.next;

for x in stack {
 current.insert(Box::new(ListNode{val: x,next:None}));
 current = &mut current.as_mut().unwrap().next;
}

 pre_head.next.take()
}
}