题解 | #删除有序链表中重复的元素-I# | Rust

/**
 *  #[derive(PartialEq, Eq, Debug, Clone)]
 *  pub struct ListNode {
 *      pub val: i32,
 *      pub next: Option<Box<ListNode>>
 *  }
 * 
 *  impl ListNode {
 *      #[inline]
 *      fn new(val: i32) -> Self {
 *          ListNode {
 *              val: val,
 *              next: None,
 *          }
 *      }
 *  }
 */
struct Solution{

}

impl Solution {
    fn new() -> Self {
        Solution{}
    }

    /**
    * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
    *
    * 
        * @param head ListNode类 
        * @return ListNode类
    */
    pub fn deleteDuplicates(&self, head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
        if head.is_none() {
            return head;
        }
        let mut head = head;
        let mut cur = head.as_mut();
        while let Some(node) = cur.take() {
            while let Some(next) = node.next.as_mut() {
                if next.val == node.val {
                    node.next = next.next.take()
                } else {
                    break;
                }
            }
            cur = node.next.as_mut();
        }
        return head;
    }
}