第3-5章节练习.pptVIP

3.30 循环队列定义为：rear指示队尾元素的位置，length指示元素的个数。给出循环队列的队满条件，写入队列和出队列的算法（出队列要返回队头元素）。 Typedef struct{ QElemType *base; int rear; int length; }SqQueue; rear rear front = rear-length+1 = 8-6+1 = 3 front = rear-length+Maxlen+1 = 1-6+10+1 = 6 front = (rear-length+1+Maxlen)%Maxlen 队满：length==Maxlen SqQueue Q; Q.Base = (QElemType *)malloc(Maxlen*sizeof(QElemType)); Status EnQueue(SqQueue Q, int x){ if(Q.length==Maxlen) return ERROR; Q.rear = (Q.rear+1)%Maxlen;?? Q.base[Q.rear] = x;?? Q.length++; return OK;} Status DeQueue(SqQueue Q, int x) {?? if(Q.length==0)