#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 node
LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
tempNodePtr->data = paraElement;
tempNodePtr->next = NULL;
//step2.Link to the exsiting rear
paraQueuePtr->rear->next = tempNodePtr;
//Step 3. It is the new rear
paraQueuePtr->rear = tempNodePtr;
}//Of enque
/**
*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 qnqueue
/**
*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
2.运行结果
103050
dequeue gets 10
dequeue gets 30
dequeue gets 50
The queue is empty.
dequeue gets -1
8
--------------------------------
Process exited after 0.1121 seconds with return value 1
请按任意键继续. . .
3.心得
顺序栈是指利用顺序存储结构实现的栈,即利用一组地址连续的存储单元依次存放自栈底到栈顶的数据元素,同时附设指针 top指示栈顶元素在顺序栈中的位置。通常习惯的做法是:以top=0表示空栈。
写顺序栈有三个步骤:
初始化,入栈,出栈。