一．#include<stdio.h>typedefintElemType;intsqQueue_maxsize=0;//链队列typedefstructNode{intdata;structNode*next;}*sqQueue;voidIniQueue(sqQueue&f,sqQueue&r)//初始化队列{f=newNode;r=f;f->next=NULL;}voidInQueue(sqQueue&f,sqQueue&r,intx)//入队{sqQueuep=newNode;p->data=x;p->next=NULL;r->next=p;r=p;sqQueue_maxsize++;}voidOutQueue(sqQueue&f,sqQueue&r)//出队{sqQueued=newNode;if(f==r)printf("停车场无车辆");else{d=f->next;if(d->next==NULL)r=f;elsef->next=d->next;sqQueue_maxsize--;}}ElemTypeGetHead_Queue(sqQueuef)//取队头{sqQueuep;p=f->next;returnp->data;}ElemTypeEmptyQueue(sqQueuef,sqQueuer)//队空{returnf==r;}ElemTypeFullQueue()//队满,设定队长度为3{returnsqQueue_maxsize==3;}voiddissqueue(sqQueuef,sqQueuer)//输出链队的所有元素；{sqQueuep;if(f==r)printf("空\n");else{p=f->next;while(p!=NULL){printf("%4d",p->data);p=p->next;}printf("\n");}}//栈#definemaxsize4typedefintElemType;typedefstruct{ElemTypedata[maxsize];inttop;}sqstack;voidinitstack(sqstack&s)//初始化栈{s.top=-1;}intisempty(sqstacks)//栈空{if(s.top==-1){return1;}else{return0;}}voidPush(sqstack&s,ElemTypek)//压栈{if(s.top>=maxsize-1)printf("栈满");else{s.top++;s.data[s.top]=k;}}voidPop(sqstack&s)//弹出栈顶元素{if(isempty(s)){printf("空栈\n");}elses.top--;}intGetTop(sqstacks)//取栈顶元素{if(isempty(s)){printf("空栈\n");return0;}returns.data[s.top];}intFullstack(sqstacks)//栈满{returns.top==maxsize-1;}voiddissqstack(sqstacks){if(!isempty(s)){inti=0;while(i<=s.top){printf("%4d",s.data[i]);i++;}}elseprintf("空栈\n");}voidmain(){intnum;charch;sqstackt,lt;initstack(t);//初始化停车场栈；initstack(lt);//初始化临时停车场栈；sqQueuebiandao_f,biandao_r;IniQueue(biandao_f,biandao_r);//初始化队列printf("请输入调动方式(c表示离开，j表示进入)和车号\n");do{