第四题完成

homework3/LinkQueue.cpp

@@ -7,6 +7,7 @@ using namespace std;
 
 void initQueue(linkQueue &q) {
     q.list = new Node;
+    q.list->next = NULL;
     q.front = q.rear = q.list;
 }
 
@@ -17,9 +18,10 @@ bool isEmpty(linkQueue &q) {
     return false;
 }
 
-bool enQueue(linkQueue &q, int e) {
+void enQueue(linkQueue &q, int e) {
+    q.rear->next = new Node;
+    q.rear->next->data = e;
     q.rear = q.rear->next;
-    q.rear->data = e;
 }
 
 int deQueue(linkQueue &q) {
@@ -27,7 +29,12 @@ int deQueue(linkQueue &q) {
         cout << "此队列为空" << endl;
         return NULL;
     }
+    Node *temp = q.front->next;
+    q.front = temp;
     int returnE = q.front->data;
-    q.front = q.front->next;
+    delete temp;
+    if (q.front->next == NULL) {
+        q.rear = q.front;
+    }
     return returnE;
 }

homework3/LinkQueue.h

@@ -18,7 +18,7 @@ void initQueue(linkQueue &q);
 
 bool isEmpty(linkQueue &q);
 
-bool enQueue(linkQueue &q, int e);
+void enQueue(linkQueue &q, int e);
 
 int deQueue(linkQueue &q);
 

homework3/test4.cpp

@@ -5,5 +5,13 @@
 using namespace std;
 
 int main() {
+    linkQueue q;
+    initQueue(q);
+    if (isEmpty(q)) {
+        //判断队空
+        cout << "此队列为空" << endl;
+    }
+    enQueue(q, 1); //入队
+    cout << deQueue(q) << endl; //出队
     return 0;
 }