build

chapter_stack_and_queue/deque.md

@@ -470,7 +470,7 @@ comments: true
 
         /* 析构方法 */
         ~LinkedListDeque() {
-            // 释放内存
+            // 遍历链表删除结点，释放内存
             DoublyListNode *pre, *cur = front;
             while (cur != nullptr) {
                 pre = cur;

chapter_stack_and_queue/queue.md

@@ -362,8 +362,8 @@ comments: true
         }
 
         ~LinkedListQueue() {
-            delete front;
+            // 遍历链表删除结点，释放内存
-            delete rear;
+            freeMemoryLinkedList(front);
         }
 
         /* 获取队列的长度 */

chapter_stack_and_queue/stack.md

@@ -353,6 +353,7 @@ comments: true
         }
 
         ~LinkedListStack() {
+            // 遍历链表删除结点，释放内存
             freeMemoryLinkedList(stackTop);
         }