考研数据结构复习——队列（链表）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/lxfHaHaHa/article/details/82901688

/**
***@Title   ：考研数据结构复习
***@Subject ：队列（链表）
***@Author  ：lxfhahaha
***@language： C语言
***@Time    ： 2018/9/29 18：50
*****/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define Inital_Size 50
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

typedef int Bool;
typedef int QElemType;
typedef int Status;

typedef struct QNode{
	QElemType data;
	struct QNode *next;
}QNode,*QueuePtr;

typedef struct {
	QueuePtr front;
	QueuePtr rear;
}LinkQueue;

//操作结果：构造一个空队列queue
Status InitQueue(LinkQueue *queue){
	queue->front=(QNode*)malloc(sizeof(QNode));
	if(!queue->front){
		printf("Malloc Error!\n");
		exit(0);
	}
	queue->rear=queue->front;
	queue->front->data=0;
	queue->front->next=NULL;
	return OK;
}

//销毁队列，queue不再存在
Status DestroyQueue(LinkQueue *queue){
	QueuePtr ptr=queue->front;
	while(ptr->next!=NULL){
		queue->front=queue->front->next;
		free(ptr);
		ptr=queue->front;
	}
	free(queue->front);
	queue->front=queue->rear=NULL;
	return OK;
}

//把queue置为空栈
Status ClearQueue(LinkQueue *queue){
	QueuePtr ptr=queue->front;
	while(ptr->next!=NULL){
		queue->front=queue->front->next;
		free(ptr);
		ptr=queue->front;
	}
	return OK;
}

//若queue为空，返回TRUE,非空返回FALSE
Bool QueueEmpty(LinkQueue queue){
	if(!queue.front){
		printf("Error!! Please inital first!!\n");
		exit(0);
	}
	return queue.front==queue.rear ? TRUE : ERROR;	
}

//返回queue中数据元素个数
int QueueLength(LinkQueue queue){
	int i;
	if(!queue.front){
		printf("Error!! Please inital first!!\n");
		exit(0);
	}
	QueuePtr ptr=queue.front;
	for(i=0;ptr!=queue.rear;i++,ptr=ptr->next);
	return i;
}

//若队列不空，则若e返回队头的元素，并返回OK，否则返回ERROR
Status GetHead(LinkQueue queue,QElemType *e){
	if(!queue.front){
		printf("Error!! Please inital first!!\n");
		exit(0);
	}
	if(QueueEmpty(queue)){
		*e=NULL;
		return ERROR;
	}	
	*e=(queue.front)->data;
	return OK;
}

//插入元素e为新的队尾元素
Status EnQueue(LinkQueue *queue,QElemType e){
	if(!queue->front){
		printf("Error!! Please inital first!!\n");
		exit(0);
	}
	queue->rear->data=e;
	QNode *ptr=(QNode *)malloc(sizeof(QNode));
	if(!ptr){
		printf("Malloc Error!!\n");
		exit(0);
	}
	ptr->next=NULL;
	queue->rear->next=ptr;
	queue->rear=ptr;
	return OK;
}


//删除queue的队头元素，用e返回其值
Status DeQueue(LinkQueue *queue,QElemType *e){
	if(!queue->front){
		printf("Error!! Please inital first!!\n");
		exit(0);
	}
	if(QueueEmpty(*queue))
		return ERROR;
	*e=queue->front->data;
	QueuePtr ptr=queue->front;
	queue->front=queue->front->next;
	free(ptr);
	return OK;
}

//从队头到队尾依次对queue中每个元素调用visit(),一旦visit()失败，则操作失败
Status QueueTraverse(LinkQueue queue,Status (*visit)(QElemType)){
	QueuePtr ptr;
	if(!queue.front){
		printf("Error!!Please inital first!!\n");
		exit(0);
	}
	for(ptr=queue.front;ptr->next!=NULL;ptr=ptr->next)
		(*visit)(ptr->data);
	return OK;	
}

//test1——print
Status PrintOne(QElemType one){
	printf("%d <- ",one);
	return OK;
}


int main()
{
	LinkQueue q;
	int i,j;
	QElemType a,b,c,d;
	InitQueue(&q);
	srand((int)time(0));		
	printf("EnQueue 10:\n");
	for(i=1;i<=10;i++)
		EnQueue(&q,(QElemType)rand()%100);
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	printf("\nlength:%d\n",QueueLength(q));
	GetHead(q,&a);
	printf("IsEmpty:%d  Head:%d\n\n",QueueEmpty(q),a);	
	
	
	ClearQueue(&q);
	printf("ClearQueue :\n");
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	printf("\nlength:%d\n",QueueLength(q));
	GetHead(q,&a);
	printf("IsEmpty:%d  Head:%d\n\n",QueueEmpty(q),a);	
	
	for(i=1;i<=10;i++)
		EnQueue(&q,(QElemType)rand()%100);
	printf("EnQueue 10:\n");
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	printf("\nlength:%d\n",QueueLength(q));
	GetHead(q,&a);
	printf("IsEmpty:%d  Head:%d\n\n",QueueEmpty(q),a);
	
	
	for(i=1;i<=6;i++)
		DeQueue(&q, &b);
	printf("DeQueue 6:\n",b);
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	printf("\nlength:%d\n",QueueLength(q));
	GetHead(q,&a);
	printf("IsEmpty:%d  Head:%d\n\n",QueueEmpty(q),a);
	
	
	
	for(i=1;i<=10;i++)
		EnQueue(&q,(QElemType)rand()%100);
	printf("EnQueue 10:\n");
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	printf("\nlength:%d\n",QueueLength(q));
	GetHead(q,&a);
	printf("IsEmpty:%d  Head:%d\n\n",QueueEmpty(q),a);
	
	
	DestroyQueue(&q);
	printf("DestroyQueue :\n");
	printf("[");
	QueueTraverse(q, PrintOne);
	printf("]");
	
	return 0;	
}