feat: add rust solution to lc problem: No.1171 (doocs#1832)

Author: poltao

solution/1100-1199/1171.Remove Zero Sum Consecutive Nodes from Linked List/README.md

@@ -227,6 +227,52 @@ function removeZeroSumSublists(head: ListNode | null): ListNode | null {
 }
 ```
 
+### **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 remove_zero_sum_sublists(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut last = std::collections::HashMap::new();
+        let mut s = 0;
+        let mut p = dummy.as_ref();
+        while let Some(node) = p {
+            s += node.val;
+            last.insert(s, node);
+            p = node.next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode::new(0)));
+        let mut q = dummy.as_mut();
+        s = 0;
+        while let Some(cur) = q {
+            s += cur.val;
+            if let Some(node) = last.get(&s) {
+                cur.next = node.next.clone();
+            }
+            q = cur.next.as_mut();
+        }
+        dummy.unwrap().next
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1171.Remove Zero Sum Consecutive Nodes from Linked List/README_EN.md

@@ -206,6 +206,52 @@ function removeZeroSumSublists(head: ListNode | null): ListNode | null {
 }
 ```
 
+### **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 remove_zero_sum_sublists(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut last = std::collections::HashMap::new();
+        let mut s = 0;
+        let mut p = dummy.as_ref();
+        while let Some(node) = p {
+            s += node.val;
+            last.insert(s, node);
+            p = node.next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode::new(0)));
+        let mut q = dummy.as_mut();
+        s = 0;
+        while let Some(cur) = q {
+            s += cur.val;
+            if let Some(node) = last.get(&s) {
+                cur.next = node.next.clone();
+            }
+            q = cur.next.as_mut();
+        }
+        dummy.unwrap().next
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1171.Remove Zero Sum Consecutive Nodes from Linked List/Solution.rs

@@ -0,0 +1,41 @@
+// 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 remove_zero_sum_sublists(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let dummy = Some(Box::new(ListNode { val: 0, next: head }));
+        let mut last = std::collections::HashMap::new();
+        let mut s = 0;
+        let mut p = dummy.as_ref();
+        while let Some(node) = p {
+            s += node.val;
+            last.insert(s, node);
+            p = node.next.as_ref();
+        }
+
+        let mut dummy = Some(Box::new(ListNode::new(0)));
+        let mut q = dummy.as_mut();
+        s = 0;
+        while let Some(cur) = q {
+            s += cur.val;
+            if let Some(node) = last.get(&s) {
+                cur.next = node.next.clone();
+            }
+            q = cur.next.as_mut();
+        }
+        dummy.unwrap().next
+    }
+}