- typedef char ElemType;
- typedef struct QNode{
- ElemType data;
- struct QNode *next;
- } QNode , *QueuePtr;
- typedef struct{
- QueuePtr front; //队头指针
- QueuePtr rear; //队尾指针
- }LinkQueue;
- initQueue(LinkQueue *q){
- /*初始化一个空队列*/
- q->front = q->rear = (QueuePtr)malloc(sizeof(QNode)); /*创建一个头结点,队头队尾指针 指向该结点*/
- if( !q->front) exit(0); /*创建头结点失败*/
- q->front->next = NULL; /*头结点指针域置NULL*/
- }
- EnQueue(LinkQueue *q, ElemType e){
- QueuePtr p;
- p = (QueuePtr)malloc(sizeof(QNode)); /*创建一个队列元素结点*/
- if( !q->front) exit(0); /*创建头结点失败*/
- p->data = e;
- p->next = NULL;
- q->rear ->next = p;
- q->rear = p;
- }
- DeQueue(LinkQueue *q, ElemType *e){
- /*如果队列q不为空,删除q的队头元素,用e返回其值*/
- QueuePtr p;
- if(q->front == q->rear) return; /*队列为空,返回*/
- p = q->front->next;
- *e = p->data;
- q->front->next = p->next;
- if(q->rear == p) q->rear = q->front; /*如果队头就是队尾,则修改队尾指针*/
- free(p);
- }
- //该片段来自于http://www.codesnippet.cn/detail/3112201411447.html
来源: http://www.codesnippet.cn/detail/3112201411447.html