#include <stdio.h>
#include <malloc.h>
/**
* 链队列的节点
*/
typedef struct LinkNode {
int data;
LinkNode* next;
}*LinkNodePtr;
/**
* 链队列
*/
typedef struct LinkQueue {
LinkNodePtr front;
LinkNodePtr rear;
}*LinkQueuePtr;
/**
* Construct an empty queue.
*/
LinkQueuePtr initQueue() {
LinkQueuePtr resultPtr = (LinkQueuePtr)malloc(sizeof(struct LinkQueue));
//The header, tje data is not useful.
LinkNodePtr headerPtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
headerPtr->next = NULL;
resultPtr->front = headerPtr;
resultPtr->rear = headerPtr;
return resultPtr;
}// of initQueue
/**
* OUtput the queue.
*/
void outputLinkQueue(LinkQueuePtr paraQueuePtr) {
LinkNodePtr tempPtr = paraQueuePtr->front->next;
while (tempPtr != NULL) {
printf("%d ", tempPtr->data);
tempPtr = tempPtr->next;
}// of while
printf("\r\n");
}// of outputLinkQueue
/**
* Enqueue
*/
void enqueue(LinkQueuePtr paraQueuePtr, int paraElement) {
//step 1. Creat a new node
LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
tempNodePtr->data = paraElement;
tempNodePtr->next = NULL;
//step 2. Link the exisiting rear
paraQueuePtr->rear->next = tempNodePtr;
//step 3. It is the new teat
paraQueuePtr->rear = tempNodePtr;
}// of enqueue
/**
* Dequeue
* @return The value of the header
*/
int dequeue(LinkQueuePtr paraQueuePtr) {
int resultValue;
LinkNodePtr tempNodePtr;
//step 1. is the queue empty?
if (paraQueuePtr->front == paraQueuePtr->rear) {
printf("The queue is empty.\r\n");
return -1;
}// of if
//step 2. Change the queue.
tempNodePtr = paraQueuePtr->front->next;
resultValue = tempNodePtr->data;
paraQueuePtr->front->next = paraQueuePtr->front->next->next;
if (paraQueuePtr->rear == tempNodePtr) {
paraQueuePtr->rear = paraQueuePtr->front;
}//of if
//step 3. Free space.
//free(temoNodePtr);
tempNodePtr = NULL;
//step 4. Return.
return resultValue;
}// of enqueue
/**
* Unit test.
*/
void testLinkQueue() {
LinkQueuePtr tempQueuePtr;
tempQueuePtr = initQueue();
enqueue(tempQueuePtr, 10);
enqueue(tempQueuePtr, 20);
enqueue(tempQueuePtr, 50);
outputLinkQueue(tempQueuePtr);
printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
printf("dequeue gets %d\r\n", dequeue(tempQueuePtr));
enqueue(tempQueuePtr, 8);
outputLinkQueue(tempQueuePtr);
}// of testLinkQueue
/**
* The entrance
*/
int main() {
testLinkQueue();
return 1;
}// of main
运行结果
心得
链队列与链表相似,不同的是它具有对列的运算方法,存储结构和链表相同,下面是其结构示意图:
这里的*Q类似于链表的头节点*head;它包含两个指向队列节点的指针front和rear;当front和rear都为NULL时队列为空;front指向队列第一个节点,rear指向最后一个节点。