3-3 银行业务队列简单模拟

#include <stdio.h>
#include <stdlib.h>

#define MAXSIZE 1000
#define ERROR -1

 struct Node{
    int Customer[MAXSIZE];
    int rear;
    int front;
};

 typedef struct Node* Queue;

 Queue CreateQueue()
 {
     Queue Q = (Queue)malloc(sizeof(struct Node));
     Q->front = 0;
     Q->rear = 0;
     return Q;
 }

 int IsEmpty(Queue Q)
 {
     return Q->front == Q->rear;
 }

 void AddQ(Queue Q, int X)
 {
     if ((Q->rear + 1) % MAXSIZE == Q->front)
     {
         printf("The queue is full!
");
         return;
     }
     Q->Customer[Q->rear] = X;
     Q->rear = (Q->rear + 1) % MAXSIZE;
 }

 int DeleteQ(Queue Q)
 {
     if (IsEmpty(Q))
     {
         printf("The queue is empty!
");
         return ERROR;
     }
     int elem = Q->Customer[Q->front];
     Q->front = (Q->front + 1) % MAXSIZE;
     return elem;
 }

 int main()
 {
     int N, X;
     int flag = 0;
     Queue Q, Q1, Q2;
     Q1 = CreateQueue();
     Q2 = CreateQueue();
     scanf_s("%d", &N);
     while (N--)
     {
         scanf_s("%d", &X);
         if (X % 2)
            AddQ(Q1, X);
         else
             AddQ(Q2, X);
     }
     while (!IsEmpty(Q1) && !IsEmpty(Q2))
     {
         if (!flag)
             flag = 1;
         else
             printf(" ");
         printf("%d", DeleteQ(Q1));
         printf(" %d", DeleteQ(Q1));
         printf(" %d", DeleteQ(Q2));
     }
     while (!IsEmpty(Q1))
     {
         if (!flag)
             flag = 1;
         else
             printf(" ");
         printf("%d", DeleteQ(Q1));
     }

        
     while (!IsEmpty(Q2))
     {
         if (!flag)
             flag = 1;
         else
             printf(" ");
         printf("%d", DeleteQ(Q2));
     }
    return 0;    
 }