队列的顺序结构和链式结构定义

队列的顺序结构：

SeQueue.h

#ifndef _SEQUEUE_H_
#define _SEQUEUE_H_


#define MAXSIZE 1000


#define FAILURE 100001
#define SUCCESS 100002


typedef int ElemType;


struct queue
{
ElemType data[MAXSIZE];
int front;
int rear;
};
typedef struct queue SeQueue; 


int QueueInit(SeQueue *Q);
int EnQueue(SeQueue *Q,ElemType e);
int QueueLength(SeQueue Q);
ElemType GetFront(SeQueue Q);
ElemType DelQueue(SeQueue *Q);


#endif

SeQueue.c

#include <stdio.h>
#include "SeQueue.h"


int QueueInit(SeQueue *Q)
{
Q->rear = Q->front = 0;
return SUCCESS;
}


int EnQueue(SeQueue *Q,ElemType e)
{
if((Q->rear +1) % MAXSIZE == Q->front)
{
return FAILURE;
}


Q->data[Q->rear] = e;
Q->rear = (Q->rear + 1)% MAXSIZE;


return SUCCESS;
}


int QueueLength(SeQueue Q)
{
return ((Q.rear - Q.front + MAXSIZE) % MAXSIZE);
}


ElemType GetFront(SeQueue Q)
{
return Q.data[Q.front];
}


ElemType DelQueue(SeQueue *Q)
{
ElemType e;


if(Q->rear == Q->front)
{
return FAILURE;
}


e = Q->data[Q->front];
Q->front = (Q->front + 1) % MAXSIZE;


return e;
}

TestSeQueue.c

#include <stdio.h>
#include "SeQueue.h"


int main()
{
int ret,i;
SeQueue sq;


ret = QueueInit(&sq);
if(FAILURE == ret)
{
printf("Init Failure!\n");
}
else
{
printf("Init Success!!\n");
}


for(i = 0;i < 10; i++)
{
ret = EnQueue(&sq,i+1);
if(FAILURE == ret)
{
printf("Enter Failure!!\n");
}
else
{
printf("Enter %d Success!!\n",i+1);
}
}


printf("Length is %d!\n",QueueLength(sq));


printf("Front Element is %d!\n",GetFront(sq));


for(i = 0; i < 5; i++)
{
printf("Delete %d Success!!\n",DelQueue(&sq));
}


printf("Length is %d!\n",QueueLength(sq));

return 0;
}

队列的链式机构：

LinkQueue.h

#ifndef _LINKQUEUE_H_
#define _LINKQUEUE_H_


#define SUCCESS 1000001
#define FAILURE 1000002


typedef int ElemType;
typedef struct node
{
ElemType data;
struct node *next;
}Node;


typedef struct queue
{
Node * front;
Node * rear;
}Queue;


int InitQueue(Queue *L);
int DeQueue(Queue *L,ElemType e);
int QueueLength(Queue L);
int GetTop(Queue L);
int DeleteQueue(Queue *L);
int ClearQueue(Queue *L);
int DestryQueue(Queue *L);


#endif

LinkQueue.c

#include <stdio.h>
#include"LinkQueue.h"
#include<stdlib.h>


int InitQueue(Queue *L)
{
L->front = (Node *)malloc(sizeof(Node));
if(L == NULL)
{
return FAILURE;
}


L->front->next = NULL;
L->rear = L->front;


return SUCCESS;
}


int DeQueue(Queue *L,ElemType e)
{
Node *n = (Node *)malloc(sizeof(Node));
if(n == NULL)
{
return FAILURE;
}


n->data = e;
n->next = NULL;
L->rear->next = n;
L->rear = n;

return SUCCESS;


}


int QueueLength(Queue L)
{
Node *n = L.front;
int j = 0;
while(n->next != NULL)
{
j++;
n = n->next;
}
return j;
}


int GetTop(Queue L)
{
if(L.front->next == NULL)
{
return FAILURE;
}
else
return L.front->next->data;
}


int DeleteQueue(Queue *L)
{
ElemType e;
Node *p = L->front->next;
if(NULL == p)
{
return FAILURE;
}
 
L->front->next = p->next;
e = p->data;
free(p);


if(NULL == L->front->next)
{
L->rear = L->front;
}


return e;
}


int ClearQueue(Queue *L)
{
ElemType e;
Node *p = L->front->next;
if(NULL == p)
{
return FAILURE;
}
while(p != NULL)
{


L->front->next = p->next;
free(p);
p=L->front->next;
if(NULL == L->front->next)
{
L->rear = L->front;
}
}
return SUCCESS;
}


int DestroyQueue(Queue *L)
{
free(L->front);
L->rear = NULL;
L->front = NULL;


return SUCCESS;
}

TestLinkQueue.c

#include <stdio.h>
#include "LinkQueue.h"


int main()
{
int ret,i;
Queue sq;
ElemType e;


ret = InitQueue(&sq);
if(ret == FAILURE)
{
printf("Init Faliure!\n");
}
else
{
printf("Init Success!\n");
}


for(i = 0; i < 5; i++)
{
e = i+1;
ret = DeQueue(&sq,e);
if(ret == FAILURE)
{
printf("Enter FAILURE!\n");
}
else 
{
printf("Enter %d Success!\n",e);
}
}


printf("Length is %d \n",QueueLength(sq));


printf("Get Top is %d \n",GetTop(sq));


for(i = 0; i < 6; i++)
{
ret = DeleteQueue(&sq);
if(ret == FAILURE)
{
printf("Delete Failure!!\n");
}
else
{
printf("Delete %d Success!!\n",ret);
}
}


ret = ClearQueue(&sq);
if(ret == FAILURE)
{
printf("Clear Failure!!\n");
}
else
{
printf("Clear Success!!\n");
}


printf("Length is %d \n",QueueLength(sq));


ret = DestroyQueue(&sq);
if(ret == FAILURE)
{
printf("Destory FAILURE!!\n");
}
else
{
printf("Destory Success!!\n");
}
return 0;
}