数据结构 队列的相关操作

用单链表实现的队列，带一个头节点

实现简单的功能，程序中可能含有bug；

 

//this program used for basic operation about queue  using list
// this list has a head node
//
//Author:zxJay
//

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

#define OK      0
#define ERROR   -1
//define the structure node
typedef struct queue
{
        int value;
        struct queue *next;
}Queue;

// front point to head node
typedef struct linkqueue
{
        Queue *front;
        Queue *tail;
}LinkQueue;

#define QUEUE_LEN  sizeof(Queue)
//init a queue

int initQueue(LinkQueue *);

//whether the queue is empty or not
int isEmptyQueue(LinkQueue *);

//get head value

int getHeadValue(LinkQueue *);

//enter a value  into queue
int enterQueue(LinkQueue *,int value);

//pop a vaue from the queue
int deQueue(LinkQueue *);

//destory the Queue
int destoryQueue(LinkQueue *);

//Clear the Queue

int clearQueue();

//return len of the Queue

int lenQueue(LinkQueue *);

//printf the Queue
int printQueue(LinkQueue *);

int main()
{
        int i = 0;
        int nodeNum = 0;
        int nodeValue = 0;
        LinkQueue Q;
        initQueue(&Q);
        printf("input number of Node:\n");
        scanf("%d",&nodeNum);
        printf("please put into node values:\n");
        for(i=0;i<nodeNum;i++)
        {
                scanf("%d",&nodeValue);
                enterQueue(&Q,nodeValue);
        }
        printQueue(&Q);
        printf("The head node value:%d\n",getHeadValue(&Q));
        printf("The len of Queue:%d\n",lenQueue(&Q));
        printf("The first value to pop:%d\n",deQueue(&Q));
        printf("The len of Queue after pop:%d\n",lenQueue(&Q));
        printf("Destory Queue !\n");
        destoryQueue(&Q);
        return 0;
}

int initQueue(LinkQueue *Q)
{
        printf("Init a queue ......\n");
        if(!(Q->front = Q->tail = (Queue *)malloc(QUEUE_LEN)))
        {
                printf("ERROR:Malloc Error !\n");
                return ERROR;
        }
        Q->front->next = NULL;
        return OK;
}

int enterQueue(LinkQueue *Q,int enterValue)
{
        Queue *tmpNode = NULL;
        if(!(tmpNode = (Queue*)malloc(QUEUE_LEN)))
        {
                printf("ERROR:Malloc Error !\n");
                return ERROR;
        }

        tmpNode->value = enterValue;
        tmpNode->next = NULL;
        Q->tail->next = tmpNode;
        Q->tail = tmpNode;

}


int isEmptyQueue(LinkQueue *Q)
{
        return  (Q->front->next == NULL);
}



int printQueue(LinkQueue *Q)
{
        Queue *tmpNode = NULL;
        tmpNode = Q->front->next;
        if(NULL == tmpNode)
        {
                printf("ERROR:Queue is NULL\n");
                return ERROR;

        }

        while(tmpNode != Q->tail)
        {
                printf("%d  ",tmpNode->value);
                tmpNode = tmpNode->next;
        }
        printf("%d\n",Q->tail->value);

}


int getHeadValue(LinkQueue *Q)
{
        if(isEmptyQueue(Q))
        {
                printf("ERROR:The Queue is empty !\n");
                return ERROR;
        }
        return Q->front->next->value;

}

int lenQueue(LinkQueue *Q)
{
        int len = 0;
        if(isEmptyQueue(Q))
        {
                return 0;
        }
        Queue *tmpNode = Q->front;
        while(tmpNode != Q->tail)
        {
                len++;
                tmpNode = tmpNode->next;
        }
        return len;

}


int deQueue(LinkQueue *Q)
{
        if(isEmptyQueue(Q))
        {
                printf("ERROR:The Queue is empty !\n");
                return ERROR;
        }
        int value;
        value = Q->front->next->value;
        Q->front->next = Q->front->next->next;
        return value;
}



int destoryQueue(LinkQueue  *Q)
{
        Queue *tmpNode = NULL;
        if(isEmptyQueue(Q))
        {
                free(Q->front);
                return OK;
        }
        while(Q->front != Q->tail)
        {
                tmpNode = Q->front->next;
                free(Q->front);
                Q->front = tmpNode;

        }
        free(Q->front);
        return OK;

}