队列的顺序存储类型描述

typedef struct {ElemType data[MaxSize];   //用一维数组存放队列元素int front,       //队头指针rear;        //队尾指针
}SqQueue;

循环队列的操作:初始化

void InitQueue(SqQueue &Q) {Q.front = Q.rear = 0;
}

循环队列的操作:判断队列是否为空

bool isEmpty(SqQueue Q) {return Q.rear == Q.front;
}

循环队列的操作:入队

bool EnQueue(SqQueue &Q, ElemType x) {if ((Q.rear + 1) % MaxSize == Q.front) {  //队满return false;}Q.data[Q.rear] = x;      //入队Q.rear = (Q.rear + 1) % MaxSize;  //队尾指针加一[环]return true;
}

循环队列的操作:出队

bool DeQueue(SqQueue &Q, ElemType &x) {if (Q.rear == Q.front) {      //队空return false;}x = Q.data[Q.front];     //获取队首元素Q.front = (Q.front + 1) % MaxSize; //队头指针加一[环]return true;
}