Add destructors to the C++ codes.

codes/cpp/chapter_stack_and_queue/array_queue.cpp

@@ -21,6 +21,10 @@ public:
         nums = new int[capacity];
     }
 
+    ~ArrayQueue() {
+        delete[] nums;
+    }
+
     /* 获取队列的容量 */
     int capacity() {
         return cap;
@@ -117,5 +121,8 @@ int main() {
         PrintUtil::printVector(queue->toVector());
     }
 
+    // 释放内存
+    delete queue;
+
     return 0;
 }

codes/cpp/chapter_stack_and_queue/array_stack.cpp

@@ -78,5 +78,8 @@ int main() {
     bool empty = stack->empty();
     cout << "栈是否为空 = " << empty << endl;
 
+    // 释放内存
+    delete stack;
+
     return 0;
 }

codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp

@@ -19,6 +19,11 @@ public:
         queSize = 0;
     }
 
+    ~LinkedListQueue() {
+        delete front;
+        delete rear;
+    }
+
     /* 获取队列的长度 */
     int size() {
         return queSize;
@@ -108,5 +113,8 @@ int main() {
     bool empty = queue->empty();
     cout << "队列是否为空 = " << empty << endl;
 
+    // 释放内存
+    delete queue;
+
     return 0;
 }

codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp

@@ -18,6 +18,10 @@ public:
         stkSize = 0;
     }
 
+    ~LinkedListStack() {
+        freeMemoryLinkedList(stackTop);
+    }
+
     /* 获取栈的长度 */
     int size() {
         return stkSize;
@@ -97,5 +101,8 @@ int main() {
     bool empty = stack->empty();
     cout << "栈是否为空 = " << empty << endl;
 
+    // 释放内存
+    delete stack;
+
     return 0;
 }