feat: add rust solution to lc problem: No.0083 (doocs#1710)

Author: poltao

solution/0000-0099/0083.Remove Duplicates from Sorted List/README.md

@@ -155,6 +155,43 @@ func deleteDuplicates(head *ListNode) *ListNode {
 }
 ```
 
+### **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_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut dummy = Some(Box::new(ListNode::new(i32::MAX)));
+        let mut p = &mut dummy;
+
+        let mut current = head;
+        while let Some(mut node) = current {
+            current = node.next.take();
+            if p.as_mut().unwrap().val != node.val {
+                p.as_mut().unwrap().next = Some(node);
+                p = &mut p.as_mut().unwrap().next;
+            }
+        }
+        dummy.unwrap().next
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0083.Remove Duplicates from Sorted List/README_EN.md

@@ -145,6 +145,43 @@ func deleteDuplicates(head *ListNode) *ListNode {
 }
 ```
 
+### **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_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut dummy = Some(Box::new(ListNode::new(i32::MAX)));
+        let mut p = &mut dummy;
+
+        let mut current = head;
+        while let Some(mut node) = current {
+            current = node.next.take();
+            if p.as_mut().unwrap().val != node.val {
+                p.as_mut().unwrap().next = Some(node);
+                p = &mut p.as_mut().unwrap().next;
+            }
+        }
+        dummy.unwrap().next
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0083.Remove Duplicates from Sorted List/Solution.rs

@@ -0,0 +1,32 @@
+// 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_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut dummy = Some(Box::new(ListNode::new(i32::MAX)));
+        let mut p = &mut dummy;
+
+        let mut current = head;
+        while let Some(mut node) = current {
+            current = node.next.take();
+            if p.as_mut().unwrap().val != node.val {
+                p.as_mut().unwrap().next = Some(node);
+                p = &mut p.as_mut().unwrap().next;
+            }
+        }
+        dummy.unwrap().next
+    }
+}