build

docs/chapter_stack_and_queue/queue.md

@@ -1070,7 +1070,7 @@ comments: true
                     }
                 }
                 self.que_size -= 1;
-                Rc::try_unwrap(old_front).ok().unwrap().into_inner().val
+                old_front.borrow().val
             })
         }
 
@@ -1081,12 +1081,18 @@ comments: true
 
         /* 将链表转化为 Array 并返回 */
         pub fn to_array(&self, head: Option<&Rc<RefCell<ListNode<T>>>>) -> Vec<T> {
-            if let Some(node) = head {
-                let mut nums = self.to_array(node.borrow().next.as_ref());
-                nums.insert(0, node.borrow().val);
-                return nums;
+            let mut res: Vec<T> = Vec::new();
+
+            fn recur<T: Copy>(cur: Option<&Rc<RefCell<ListNode<T>>>>, res: &mut Vec<T>) {
+                if let Some(cur) = cur {
+                    res.push(cur.borrow().val);
+                    recur(cur.borrow().next.as_ref(), res);
+                }
             }
-            return Vec::new();
+
+            recur(head, &mut res);
+
+            res
         }
     }
     ```