//入链队列 void lappend(lqueue *q,int x) { qnodetype *p; p=(qnodetype *)malloc(sizeof(qnodetype)); p->data=x; p->next=null; q->rear->next=p; q->rear=p; }

//出链队列 elemtype ldelete(lqueue *q) { qnodetype *p; elemtype x; if(q->front==q->rear) { printf("队列为空!\n"); exit(0); } p=q->front ->next ; q->front->next=p->next ; x=p->data; if(q->rear==p) { q->rear=q->front; } free(p); return x; }

#includestdioh#includestdlibh#define null 0#define elemtype inttypedef struct qnode	elemtype data;	struct qnode next;qnodetype;typedef struct 	qnodetype front;	qnodetype rear;lqueue;入链队列void lappendlq

原文地址: https://www.cveoy.top/t/topic/balp 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录