feat: add rust solution to lcof problem: No.06 (doocs#660)

Author: YangFong

lcof/面试题06. 从尾到头打印链表/README.md

@@ -239,6 +239,39 @@ function reversePrint(head: ListNode | null): number[] {
 }
 ```
 
+### **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 reverse_print(head: Option<Box<ListNode>>) -> Vec<i32> {
+        let mut arr: Vec<i32> = vec![];
+        let mut cur = head;
+        while let Some(node) = cur {
+            arr.push(node.val);
+            cur = node.next;
+        }
+        arr.reverse();
+        arr
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题06. 从尾到头打印链表/Solution.rs

@@ -0,0 +1,28 @@
+// 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 reverse_print(head: Option<Box<ListNode>>) -> Vec<i32> {
+        let mut arr: Vec<i32> = vec![];
+        let mut cur = head;
+        while let Some(node) = cur {
+            arr.push(node.val);
+            cur = node.next;
+        }
+        arr.reverse();
+        arr
+    }
+}