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

Author: YangFong

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

@@ -241,6 +241,8 @@ function reversePrint(head: ListNode | null): number[] {
 
 ### **Rust**
 
+- 动态数组
+
 ```rust
 // Definition for singly-linked list.
 // #[derive(PartialEq, Eq, Clone, Debug)]
@@ -272,6 +274,46 @@ impl Solution {
 }
 ```
 
+- 遍历
+
+```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 cur = &head;
+        let mut n = 0;
+        while let Some(node) = cur {
+            cur = &node.next;
+            n += 1;
+        }
+
+        let mut arr = vec![0; n];
+        let mut cur = head;
+        while let Some(node) = cur {
+            n -= 1;
+            arr[n] = node.val;
+            cur = node.next;
+        }
+        arr
+    }
+}
+```
+
 ### **...**
 
 ```