数据结构——停车场管理.docVIP

一． #includestdio.h typedef int ElemType; int sqQueue_maxsize=0; //链队列 typedef struct Node { int data; struct Node *next; }*sqQueue; void IniQueue(sqQueue f ,sqQueue r) //初始化队列 { f=new Node; r=f; f-next=NULL; } void InQueue(sqQueue f,sqQueue r,int x) //入队 { sqQueue p=new Node; p-data=x; p-next=NULL; r-next=p; r=p; sqQueue_maxsize++; } void OutQueue(sqQueue f,sqQueue r) //出队 { sqQueue d=new Node; if(f==r) printf(停车场无车辆); else { d=f-next; if(d-next==NULL) r=f; else f-next=d-next; sqQueue_maxsize--; } } ElemType GetHead_Queue(sqQueue f) //取队头 { sqQueue p;