queue2.cpp

自己写的数据结构代码

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#include <math.h>
#include <process.h>

#define OK 1
#define ERROR 0
typedef int Status;
typedef int QElemType;
#define MAXQSIZE 10000

struct SqQueue
{
	QElemType *base;
	int frount;
	int rear;
};

Status InitQueue(SqQueue &Q)
{
	Q.base=(QElemType *)malloc(MAXQSIZE*sizeof(QElemType));
	Q.frount=Q.rear=0;
	return OK;
}

Status EnQueue(SqQueue &Q,QElemType e)
{
	if((Q.rear+1)%MAXQSIZE==Q.frount)  return ERROR;
	Q.base[Q.rear]=e;
	Q.rear=(Q.rear+1)%MAXQSIZE;
	return OK;
}

int QueueTraverse(SqQueue Q)
{
	int i;
	i=Q.frount;
	if((Q.rear+1)%MAXQSIZE==Q.frount)  return ERROR;
	while(i!=Q.rear)
	{
		printf("%d ",(*(Q.base+i)));
		i=(i+1)%MAXQSIZE;
	}
	printf("\n");
	return OK;
}

Status DeQueue(SqQueue &Q,QElemType &e)
{
	if(Q.frount==Q.rear)  return ERROR;
	e=Q.base[Q.frount];
	Q.frount=(Q.frount+1)%MAXQSIZE;
	return OK;
}

int QueueLength(SqQueue Q)
{
	return (Q.rear-Q.frount+MAXQSIZE)%MAXQSIZE;
}

int main()
{
	SqQueue Q;
	int choose,e;
	if(InitQueue(Q)==OK)
	{
		while(1)
		{
			printf("1:enter 2:delete 3:length 4:traverse 5:exit please choose:\n"); 

			scanf("\n%d",&choose);
			switch(choose)
			{
			case 1:scanf("\n%d",&e);
				if(EnQueue(Q,e)==OK)
					printf("%d is entered.\n",e); 
				break;
			case 2:if(DeQueue(Q,e)==OK)
					   printf("%d is deleted.\n",e); 
				else
					printf("the queue is empty.\n"); 
				break;
			case 3:printf("Length of the queue is %d\n", QueueLength(Q)); 
				break;
			case 4:if(QueueTraverse(Q)==ERROR)
					   printf("error\n"); 
				break;
			case 5:return 0;
			}
		}
	}
	return 0;
}