C语言停车场管理系统源代码.doc

#include#include#define stacksize 2 /车站/容量/typedef struct Snode int number; float int_time2; float bian_time2;record;typedef struct record *base; record *top; int size;Stack;/typedef struct Qnode int number; float int_time2; struct Qnode *next;Qnode,*Queue;typedef struct Queue front; Queue rear;Linkqueue;void xunhuan(Stack L,Linkqueue Q);void jixu(Stack L,Linkqueue Q);/void InitStack(Stack &L) /堆栈操作 L.base=(record*)malloc(sizeof(Snode)*stacksize); if(!L.base) exit(0); L.top=L.base; L.size=stacksize;/void input(Stack &L,record h) *L.top+=h; /Snode output(Stack &L,record &e) e=*-L.top; return e; int Stackman(Stack L) if(L.top-L.base=L.size) return 0; else return 1;int StackEmpty(Stack L) if(L.base=L.top) return 0; else return 1;/void Initque(Linkqueue &Q) /队列操作 Q.front=Q.rear=(Queue)malloc(sizeof(Qnode); if(!Q.front) exit(0); Q.front-next=NULL;/void enqueue(Linkqueue &Q,int number,float time) Queue q; printf(停车场已满，请将车辆停入便道!n); q=(Queue)malloc(sizeof(Qnode); q-int_time0=time0; q-int_time1=time1; q-number=number; q-next=NULL; Q.rear-next=q; Q.rear=q; /void outqueue(Linkqueue &Q,Queue &e) /此处有点问题？ / Qnode *q; /q=(Queue)malloc(sizeof(Qnode); e=Q.front-next; / Q.front-next=q-next;/delete q; Q.front-next=Q.front-next-next; if(Q.rear=e) Q.front=Q.rear; / Q.front=NULL; int QEmpty(Linkqueue Q) if(Q.rear=Q.front) return 0; else return 1;/ /停车场管理操作/void jixu(Stack L,Linkqueue Q)int n; fflush(stdin); scanf(%d,&n);switch(n)case 1:printf(nn);xunhuan(L,Q); break;case 2:printf(*退出管理系统*n); break;default:printf(n输入错误，请重新输入: );jixu(L,Q);break;void jiaofei(float time,float time1,float time2) /缴费操作 float data1,data2;double money;if(time20!=0&time21!=0) data2=(time10-time20-1)*60+60-time21+time11;elsedata2=0;data1=(time0-time10-1)*60+60-time11+time1;/printf(进入车场时间%f,退出车场时间%fn,time11,time1);printf(你的停车时间为%lf小时 ,在便道停留时间%f小时n,data1/60,data2/60); money=data1/60*5.0+data2/60*2.0; printf(请交纳%lf元n,money); /* if(data160.0&data1120.0)printf(请交纳20元。);*/void leave(Stack &L,Linkqueue &Q,int number,float time) /汽车离开操作Stack S;InitStack(S);float time12,time22; record e,e1;Queue q; e1=output(L,e); while(e.number!=number) input(S,e1); e1=output(L,e); time10=_time0; /入车站时间time11=_time1;time20=e.bian_time0; /入便道时间time21=e.bian_time1; jiaofei(time,time1,time2); / while(StackEmpty(S) input(L,output(S,e1); while(QEmpty(Q)&Stackman(L) outqueue(Q,q); /printf(nn请输入汽车从便道进入停车场的时间，输入格式为（时 空格 分）:); e.bian_time0=q-int_time0; e.bian_time1=q-int_time1; /scanf(%f %f,&time20,&time21); _time0=time0; _time1=time1; e.number=q-number; printf(n汽车从便道退出进入停车场); printf(n请将%d号车停在%d号位置！n,e.number,L.top-L.base+1); input(L,e); /void xunhuan(Stack L,Linkqueue Q) /选择操作及循环/Queue q; char ch; int number; float time2,time22; fflush(stdin); printf(nA:进入停车场 D：退出停车场 E：退出管理系统n); printf(n请输入：); scanf(%c,&ch);fflush(stdin); switch(ch) case A: printf(n请输入车牌号: ); scanf(%d,&number); printf(请输入入场时间，输入格式为（时 空格 分）:); scanf(%f %f,&time0,&time1); if(Stackman(L) record e; _time0=time0; _time1=time1; e.bian_time0=0.0; e.bian_time1=0.0; e.number=number; printf(请将车停在%d号位置！,L.top-L.base+1); input(L,e); else enqueue(Q,number,time); printf(n); printf(n1、继续操作 2、退出操作 : ); jixu(L,Q); break; case D: if(StackEmpty(L) printf(请输入离开汽车的车牌号：); scanf(%d,&number); printf(输入汽车离开时间：); scanf(%f %f,&time20,&time21); leave(L,Q,number,time2); else printf(停车场为空n); printf(n1、继续操作 2、退出操作 : ); jixu(L,Q); break; case E: printf(*退出管理系统*n); break; default: printf(输入错误，请重新输入！n); printf(#n); xunhuan(L,Q); break; /void main() /主函数操作