C语言实现循环队列入队操作：判断队列满

typedef int Status; typedef int ElemType;

#define MaxQSize 10

typedef struct { ElemType *base; int front; int rear; Status flag; } Queue;

Status EnQueue(Queue &q, ElemType e) { if (q.front == q.rear && q.flag == 1) { // 队列满 return 0; } q.base[q.rear] = e; q.rear = (q.rear + 1) % MaxQSize; q.flag = 1; return 1; }