顺序存储的实现
循环队列的顺序存储结构
typedef struct
{
QElemType data[MAXSIZE];
int front;
int rear;
}SqQueue;
初始化队列
Status InitQueue(SqQueue *Q){
Q->front = 0;
Q->rear = 0;
return OK;
}
队列清空
Status ClearQueue(SqQueue *Q){
Q->front = Q->rear = 0;
return OK;
}
判断队列是否为空
Status QueueEmpty(SqQueue Q){
if (Q.front == Q.rear)
return TRUE;
else
return FALSE;
}
队列长度
int QueueLength(SqQueue Q){
return (Q.rear - Q.front + MAXSIZE)%MAXSIZE;
}
取出对头元素
Status GetHead(SqQueue Q,QElemType *e){
if (Q.front == Q.rear)
return ERROR;
*e = Q.data[Q.front];
return OK;
}
入队
Status EnQueue(SqQueue *Q,QElemType e){
if((Q->rear+1)%MAXSIZE == Q->front)
return ERROR;
Q->data[Q->rear] = e;
Q->rear = (Q->rear+1)%MAXSIZE;
return OK;
}
出队
Status DeQueue(SqQueue *Q,QElemType *e){
if (Q->front == Q->rear) {
return ERROR;
}
*e = Q->data[Q->front];
Q->front = (Q->front+1)%MAXSIZE;
return OK;
}
遍历队列
Status QueueTraverse(SqQueue Q){
int i;
i = Q.front;
while ((i+Q.front) != Q.rear) {
printf("%d ",Q.data[i]);
i = (i+1)%MAXSIZE;
}
printf("\n");
return OK;
}
链式存储的实现
循环队列的链式存储结构
typedef struct QNode
{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
QueuePtr front,rear;
}LinkQueue;
初始化队列
Status InitQueue(LinkQueue *Q){
Q->front = Q->rear = (QueuePtr)malloc(sizeof(QNode));
if (!Q->front) {
return ERROR;
}
Q->front->next = NULL;
return OK;
}
销毁队列
Status DestoryQueue(LinkQueue *Q){
while (Q->front) {
Q->rear = Q->front->next;
free(Q->front);
Q->front = Q->rear;
}
return OK;
}
将队列Q置空
Status ClearQueue(LinkQueue *Q){
QueuePtr p,q;
Q->rear = Q->front;
p = Q->front->next;
Q->front->next = NULL;
while (p) {
q = p;
p = p->next;
free(q);
}
return OK;
}
判断队列Q是否为空
Status QueueEmpty(LinkQueue Q){
if (Q.front == Q.rear)
return TRUE;
else
return FALSE;
}
获取队列长度
int QueueLength(LinkQueue Q){
int i= 0;
QueuePtr p;
p = Q.front;
while (Q.rear != p) {
i++;
p = p->next;
}
return i;
}
插入元素e为队列Q的新元素
Status EnQueue(LinkQueue *Q,QElemType e){
QueuePtr s = (QueuePtr)malloc(sizeof(QNode));
if (!s) {
return ERROR;
}
s->data = e;
s->next = NULL;
Q->rear->next = s;
Q->rear = s;
return OK;
}
出队列
Status DeQueue(LinkQueue *Q,QElemType *e){
QueuePtr p;
if (Q->front == Q->rear) {
return ERROR;
}
p = Q->front->next;
*e = p->data;
Q->front->next = p ->next;
if(Q->rear == p) Q->rear = Q->front;
free(p);
return OK;
}
获取队头元素
Status GetHead(LinkQueue Q,QElemType *e){
if (Q.front != Q.rear) {
*e = Q.front->next->data;
return TRUE;
}
return FALSE;
}
遍历队列
Status QueueTraverse(LinkQueue Q){
QueuePtr p;
p = Q.front->next;
while (p) {
printf("%d ",p->data);
p = p->next;
}
printf("\n");
return OK;
}