3.6 链队列

#include <stdio.h>
#include <malloc.h>

/**
 *链队列的节点
 */
typedef struct LinkNode{
	int data;
	struct 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,the 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. Create a new code.
	LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	tempNodePtr->data = paraElement;
	tempNodePtr->next = NULL;
	
	//Step 2. Link to the existing rear.
	paraQueuePtr->rear->next = tempNodePtr;
	
	//Step 3. It is the new rear.
	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(tempNodePtr);
	tempNodePtr = NULL;
	
	//Step 4. Return.
	return resultValue;
}//Of enqueue.

/**
 *Unit test.
 */
void testLinkQueue(){
	LinkQueuePtr tempQueuePtr;
	tempQueuePtr = initQueue();
	enqueue(tempQueuePtr,10);
	enqueue(tempQueuePtr,30);
	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.

结果：