链队列存储结构及常见操作.docVIP

/*~~~~~~~~~~~~~~~~~~~链队列存储结构及常见操作（lkqueue.c）~~~~~~~~~~~~~*/ #ifndef __LINKQUEUE__ #define __LINKQUEUE__ #include stdlib.h /*链队列存储结构类型定义*/ typedef struct lkqenode { QueueDT data; struct lkqenode* next; }QNode, *QLink; typedef struct { //QLink front; QLink rear; int len; }LinkQueue; /*链队列初始化*/ void QueueInitialize(LinkQueue *pQ) { pQ-rear=(QLink)malloc(sizeof(QNode)); if(!pQ-rear) exit(EXIT_FAILURE); pQ-rear-next=pQ-rear; pQ-len=0; } /*求链队列长度*/ int QueueLen(LinkQueue Q) { return Q.len; } /*判断链队列是否为空*/ BOOL QueueEmpty(LinkQueue Q) { /*也可用：return Q.rear == Q.rear-next ? TRUE: FALSE; */ return 0 == Q.len ? TRUE: FALSE; } /*链队列入队列操作*/ void EnQueue(LinkQueue *pQ, QueueDT d) { QLink p; p=(QLink)malloc(sizeof(QNode)); if(!p) exit(EXIT_FAILURE); p-data=d; p-next=pQ-rear-next;//1 pQ-rear-next=p;//2 pQ-rear=p;//3 pQ-len++;//4 } /*链队列出队列操作*/ BOOL DeQueue(LinkQueue *pQ, QueueDT *pd) { BOOL flg=TRUE; QLink p,front; if(QueueEmpty(*pQ)) flg=FALSE; else { front=pQ-rear-next; p=front-next; front-next=p-next; *pd=p-data; if(pQ-rear==p) pQ-rear=front; free(p); pQ-len--; } return flg; } /*取链队列队首元素*/ BOOL QueueHead(LinkQueue Q, QueueDT *pd) { BOOL flg=TRUE; if(QueueEmpty(Q)) flg=FALSE; else *pd=Q.rear-next-next-data; return flg; } /*清空链队列*/ void QueueClear(LinkQueue *pQ) { QLink p,q,head; if(pQ-len0) { head=pQ-rear-next; pQ-rear=head; p=head-next; head-next=head; pQ-len=0; while(p!=head) { q=p; p=p-next; free(q); } } } /*销毁链队列*/ void QueueDestroy(LinkQueue Q) { QueueClear(Q); free(Q.rear); } #endif /*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/ /* 建议性测试用程序 */ typedef enum {TRUE=1,FALSE=0} BOOL; typedef int QueueDT; #include lkqueue.c #define N 10 void main() { int i; QueueDT d,a[N]={0,1,2,3,4,5,6,7,8,9}; LinkQueue queue; QueueInitialize(queue); printf(\nEnQueue:\n); for(i=0; iN; i++) { printf(%3d,a[i]); EnQueue(queue,a[i]); } QueueHead(queue,d); printf(\nQueueHead=%d\n,