Fine tune the C codes.

codes/c/chapter_stack_and_queue/array_queue.c

@@ -127,5 +127,6 @@ int main() {
 
     // 释放内存
     delArrayQueue(queue);
+
     return 0;
 }

codes/c/chapter_stack_and_queue/linkedlist_deque.c

@@ -43,6 +43,7 @@ LinkedListDeque *newLinkedListDeque() {
     deque->front = NULL;
     deque->rear = NULL;
     deque->queSize = 0;
+    return deque;
 }
 
 /* 析构方法 */
@@ -207,7 +208,8 @@ int main() {
     bool isEmpty = empty(deque);
     printf("双向队列是否为空 = %s\r\n", isEmpty ? "true" : "false");
 
-    /* 释放内存 */
+    // 释放内存
     delLinkedListdeque(deque);
+
     return 0;
 }

codes/c/chapter_stack_and_queue/linkedlist_queue.c

@@ -20,6 +20,7 @@ LinkedListQueue *newLinkedListQueue() {
     queue->front = NULL;
     queue->rear = NULL;
     queue->queSize = 0;
+    return queue;
 }
 
 /* 析构方法 */

codes/c/chapter_stack_and_queue/linkedlist_stack.c

@@ -109,7 +109,8 @@ int main() {
     bool empty = isEmpty(stack);
     printf("栈是否为空 = %s\n", empty ? "true" : "false");
 
-    /* 析构方法 */
+    // 释放内存
     delLinkedListStack(stack);
+
     return 0;
 }