feat: add rust solution to lcof problem: No.18

面试题18. 删除链表的节点

Author: YangFong

lcof/面试题18. 删除链表的节点/README.md

@@ -169,6 +169,40 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+//
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn delete_node(mut head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
+        let mut cur = &mut head;
+        while let Some(node) = cur {
+            if node.val == val {
+                *cur = node.next.take();
+                break;
+            }
+            cur = &mut cur.as_mut().unwrap().next;
+        }
+        head
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题18. 删除链表的节点/Solution.rs

@@ -0,0 +1,29 @@
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+//
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn delete_node(mut head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
+        let mut cur = &mut head;
+        while let Some(node) = cur {
+            if node.val == val {
+                *cur = node.next.take();
+                break;
+            }
+            cur = &mut cur.as_mut().unwrap().next;
+        }
+        head
+    }
+}