013_10.1_QueueLinkList.c

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

typedef struct QNode {

	int nValue;
	struct QNode *pNext;
} QNode, *PQNode;

typedef struct
{
	PQNode pHead;
	PQNode pTail;
} LinkQueue;

void Create(LinkQueue *pLink) {

	if (pLink == NULL) {
        
		exit(0);
    }

	PQNode pTmp = (PQNode)malloc(sizeof(QNode));
	pLink->pHead = pLink->pTail = pTmp;
	pLink->pHead->pNext = NULL;
	pLink->pHead->nValue = 0;
}

void EnQueue(LinkQueue *pLink, int nValue) {

	PQNode pTmp = (PQNode)malloc(sizeof(QNode));
	pTmp->nValue = nValue;
	pTmp->pNext = NULL;

	pLink->pTail->pNext = pTmp;
	pLink->pTail = pTmp;
}

int DeQueue(LinkQueue *pLink) {
	
	if (pLink->pHead == pLink->pTail) {
		
		printf("队列为空，无法出队！\n");
		exit(0);
	}

	PQNode pTmp = pLink->pHead->pNext;
	pLink->pHead->pNext = pTmp->pNext;

	if (pLink->pTail == pTmp) {

		pLink->pTail = pLink->pHead;
	}

	int nValue = pTmp->nValue;
	free(pTmp);
	pTmp = NULL;

	return nValue;
}

bool IsEmpty(LinkQueue *pLink)
{
    return pLink->pHead == pLink->pTail;
}

void main()
{
    LinkQueue *pLink = (LinkQueue *)malloc(sizeof(LinkQueue));
    Create(pLink);
	int i;
    for (i = 0; i < 10; i++)
    {
        EnQueue(pLink, i);
    }
    
    for (i = 0; i < 11; i++)
    {
        printf("%d ", DeQueue(pLink));
    }

}