队列
链队列
结构体定义
#include <iostream>
#define OK 1
#define ERROR 0
#define QElemType int //结点数据域的数据类型
typedef int Status;
typedef struct QNode{ //链队列结点的结构体定义
QElemType data; //结点的数据域
struct QNode *next;//指针域
}QNode,*QueuePtr;
typedef struct { //链队列的结构体定义
QueuePtr front;//对头指针
QueuePtr rear;//队尾指针
}LinkQueue;
InitQueue初始化队列
//初始化一个带头结点的空链队列
Status InitQueue(LinkQueue &Q){
Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
Q.front->next=NULL;
return OK;
}
EnQueue入队列
//入队列
Status EnQueue(LinkQueue &Q,QElemType e){
QueuePtr S=(QueuePtr)malloc(sizeof(QNode));
S->data=e;
S->next=NULL;
Q.rear->next=S;
Q.rear=S;
return OK;
}
DeQueue出队列
//出队列
Status DeQueue(LinkQueue &Q,QElemType &e){
if(Q.front==Q.rear)return ERROR;//如果队列为空,就结束了
QueuePtr P;
P=Q.front;
e=P->next->data;
Q.front=Q.front->next;
free(P);
return OK;
}
GetHead取队头
Status GetHead(LinkQueue Q,ElemType &e)
{
if(Q.front==Q.rear)return ERROR;
e=Q.front->next->data;
return OK;
}
顺序队列(以循环队列为例)
判断堆满: (Q.rear+1)%MAXSIZE == Q.front
判断对空: Q.front == Q.rear
求队列长度:(Q.rear-Q.front+MAXSIZE)%MAXSIZE
循环队列结构体定义
#define QElemType int
#define MAXSIZE 20
typedef int Status;
typedef struct {
QElemType *base;
QElemType front;
QElemType rear;
}SqQueue;
InitQueue初始化循环队列
Status InitQueue(SqQueue &Q){
Q.base=(QElemType *)malloc(MAXSIZE*sizeof(QElemType));
Q.front=Q.rear=0;
return OK;
}
EnQueue入队列
//入队列
Status EnQueue(SqQueue &Q,QElemType e){
//入队列先判断队满
if((Q.rear+1)%MAXSIZE==Q.front)return ERROR;
Q.base[Q.rear]=e;
Q.rear=(Q.rear+1)%MAXSIZE;
return OK;
}
DeQueue出队列
//出队列
Status DeQueue(SqQueue &Q,QElemType &e){
//出队列先判断队空
if(Q.front==Q.rear)return ERROR;
e=Q.base[Q.front];
Q.front=(Q.front+1)%MAXSIZE;
return OK;
}
QueueLenth求循环队列长度
int QueueLenth(SqQueue Q)
{
return(Q.rear-Q.front+MAXSIZE)%MAXSIZE;
}