循环队列的基本操作 #include<iostream> using namespace std; #define MAXSIZE 10 typedef int QueueElemType; typedef struct { QueueElemType elem[MAXSIZE]; int front; int rear; }SeqQueue; void InitQueue(SeqQueue &Q); void Clear(SeqQueue &Q); bool Isempty(SeqQueue Q); bool Isfull(SeqQueue Q); void EnQueue(SeqQueue &Q, QueueElemType e); void DelQueue(SeqQueue &Q, QueueElemType &e); void Gethead(SeqQueue Q, QueueElemType &e); void Input(SeqQueue &Q); void Output(SeqQueue Q); void Interface(); int main() { Interface(); SeqQueue Q; int n; while (1) { cout << "请输入操作序号:"; cin >> n; switch (n) { case 1: { InitQueue(Q); break; } case 2: { Clear(Q); break