xshang

摘要： 问题：主要是队列为空和满的条件. 为空：cqueue->front==cqueue->rear 为满(cqueue->rear+1)==cqueue->front代码:#include <iostream>#include <cstdlib>using namespace std;#define MAXSIZE 20typedef struct CQueue{ int front; int rear; int data[MAXSIZE];}*CirQueue;void initCQueue(CirQueue &cqueue){ cqueu 阅读全文