请补充完整代码，实现以下功能：在循环队列中入队和出队元素。typedef char QElemType;
typedef char SElemType;
typedef int Status;
typedef struct {
QElemType *base;
int front;
int rear;
} SqQueue;
Status InitQueue(SqQueue &Q) {
(1) ______________________
if (!Q.base)
exit(OVERFLOW);
(2) ______________
return OK;
}
Status EnQueue(SqQueue &Q, QElemType e) {
if ((3) _______________________ )
return ERROR;
Q.base[Q.rear] = e;
(4) __________________________
return OK;
}
Status DeQueue(SqQueue &Q, QElemType &e) {
if ((5) _____________)
return ERROR;
e = Q.base[Q.front];
(6) _______________
return OK;
}
int main() {
SqQueue Q;
int n, i;
char c;
InitQueue(Q);
cin >> n;
for(i=0;i<n;i++){
cin >> c;
EnQueue(Q,c);
}
for(i=0;i<n;i++){
DeQueue(Q,c);
cout << c << " ";
}
return 0;
}
收藏
