int len; len = (Q->rear - Q->front + MAXQSIZE) % MAXQSIZE; //求元素个数,即队列长度 printf("长度为:%d\n", len); return 0; } int EnQueue(SqQueue *q, int e) { if ((q->rear + 1) % MAXQSIZE == q->front) //尾指针在循环意义上加1后等于头指针,表明队满 { printf("队...