第二题八个数字测试完成

homework3/SeqQueue.cpp

@@ -28,8 +28,8 @@ void enQueue(SeqQueue &q, int e) {
         cout << "此队列已满" << endl;
         return;
     }
-    q.rear = (q.rear + 1) % MAX_SIZE;
     q.data[q.rear] = e;
+    q.rear = (q.rear + 1) % MAX_SIZE;
 }
 
 int deQueue(SeqQueue &q) {
@@ -37,6 +37,7 @@ int deQueue(SeqQueue &q) {
         cout << "此队列为空" << endl;
         return NULL;
     }
-    return q.data[q.front];
-    q.front(q.front - 1) % MAX_SIZE;
+    int returnE = q.data[q.front];
+    q.front = (q.front + 1) % MAX_SIZE;
+    return returnE;
 }