feat: add rust solution to lc problem: No.2095 (#5258)

Author: yanglbme

solution/2000-2099/2095.Delete the Middle Node of a Linked List/README.md

@@ -214,6 +214,53 @@ function deleteMiddle(head: ListNode | null): ListNode | null {
 }
 ```
 
+#### 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_middle(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut slow = 0;
+        let mut fast = head.as_ref();
+
+        while let Some(node) = fast {
+            if node.next.is_none() {
+                break;
+            }
+            slow += 1;
+            fast = node.next.as_ref().unwrap().next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut cur = dummy.as_mut();
+
+        for _ in 0..slow {
+            cur = cur.unwrap().next.as_mut();
+        }
+
+        let node = cur.unwrap();
+        node.next = node.next.as_mut().unwrap().next.take();
+
+        dummy.unwrap().next
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2000-2099/2095.Delete the Middle Node of a Linked List/README_EN.md

@@ -206,6 +206,53 @@ function deleteMiddle(head: ListNode | null): ListNode | null {
 }
 ```
 
+#### 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_middle(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut slow = 0;
+        let mut fast = head.as_ref();
+
+        while let Some(node) = fast {
+            if node.next.is_none() {
+                break;
+            }
+            slow += 1;
+            fast = node.next.as_ref().unwrap().next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut cur = dummy.as_mut();
+
+        for _ in 0..slow {
+            cur = cur.unwrap().next.as_mut();
+        }
+
+        let node = cur.unwrap();
+        node.next = node.next.as_mut().unwrap().next.take();
+
+        dummy.unwrap().next
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2000-2099/2095.Delete the Middle Node of a Linked List/Solution.rs

@@ -0,0 +1,42 @@
+// 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_middle(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut slow = 0;
+        let mut fast = head.as_ref();
+
+        while let Some(node) = fast {
+            if node.next.is_none() {
+                break;
+            }
+            slow += 1;
+            fast = node.next.as_ref().unwrap().next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut cur = dummy.as_mut();
+
+        for _ in 0..slow {
+            cur = cur.unwrap().next.as_mut();
+        }
+
+        let node = cur.unwrap();
+        node.next = node.next.as_mut().unwrap().next.take();
+
+        dummy.unwrap().next
+    }
+}