停车场,正确的.doc

#include#includeusing namespace std;#define MAX 2 /停车场车位数#define price 0.05 /每分钟收取的费用typedef struct time int hour; int min;Time;/定义时间结点typedef struct node string num; Time reach; Time leave;CarNode;/定义每辆车的牌号，进入时刻，开出时刻typedef struct NODE CarNode *stackMAX+1; int top;SeqStackCar;/用栈定义，构造停车场typedef struct car CarNode *data; struct car *next;QueueNode;/用队列结点定义，构造停车场外的单个等候车辆typedef struct Node QueueNode *head; QueueNode *rear;LinkQueueCar;/用队列定义，构造停车场外的等候便道void InitStack(SeqStackCar *); /初始化堆栈函数声明int InitQueue(LinkQueueCar *); /初始化队列头结点函数声明int Arrival(SeqStackCar *,LinkQueueCar *); /车辆进入时登记函数声明void Leave(SeqStackCar *,SeqStackCar *,LinkQueueCar *);/车辆离开时函数声明void List(SeqStackCar,LinkQueueCar); /*查看停车场内车辆情况及便道上车辆情况的函数声明*/void main( ) SeqStackCar Enter,Temp;/初始栈，中转栈 LinkQueueCar Wait;/便道队列 int a; InitStack(&Enter); InitStack(&Temp); InitQueue(&Wait);/初始化while(1) cout*endl; cout 欢迎光临停车场！; cout(*_*) ！; coutendl请按 1; cout请按 2endl; cout请按 3; cout请按 4a; if(a=1&a=4) break; else coutendltop=0; s-stacks-top=NULL;int InitQueue(LinkQueueCar *Q)/队列初始化 Q-head=new QueueNode ; if(Q-head!=NULL) Q-head-next=NULL; Q-rear=Q-head; return 1; else return -1;void PRINT(CarNode *p,int room) /输出离开停车场的车辆情况 int A,B,C,D; coutp-leave.hourp-leave.min; cout离开车辆的车牌号为:; coutnum; coutendl其到达时间为: reach.hour:reach.min; cout离开时间为: leave.hour:leave.min; A=p-reach.hour; B=p-reach.min; C=p-leave.hour; D=p-leave.min; coutendl应交费用为: (C-A)*60+(D-B)*price元endl; cout车辆离开登记完毕!endl; cout*endl; delete p;int Arrival(SeqStackCar *Enter,LinkQueueCar *W) CarNode *p; QueueNode *t; p=new CarNode; cout*endl; cout车辆到达登记开始：endl; coutendlp-num; if(Enter-toptop+; coutendl车辆在车场第top位置.; coutendlp-reach.hourp-reach.min; coutendl车辆到达登记完毕!endl; cout*stackEnter-top=p; return 1; else /如果车位已满，则停靠在便道上 cout*endl; coutendl该车须在便道等待!有车位时进入车场data=p; t-next=NULL; W-rear-next=t; W-rear=t; return 1; void Leave(SeqStackCar *Enter,SeqStackCar *Temp,LinkQueueCar *W) int room; CarNode *p,*t; QueueNode *q; if(Enter-top0) while(1) cout*endl; cout车辆离开登记开始:endl; coutendl请输入车在车场的位置/1-toproom; if(room=1&roomtop) break;while(Enter-toproom)/从停车场堆栈向中转堆栈移动车辆，直到要离开车辆的位置停止 Temp-top+; Temp-stackTemp-top=Enter-stackEnter-top; Enter-stackEnter-top=NULL; Enter-top-; p=Enter-stackEnter-top; Enter-stackEnter-top=NULL; Enter-top-;while(Temp-top=1)/将中转堆栈中的车辆移回停车场堆栈 Enter-top+; Enter-stackEnter-top=Temp-stackTemp-top; Temp-stackTemp-top=NULL; Temp-top-;cout*endl;cout车辆离开登记结算：head!=W-rear)&Enter-tophead-next; t=q-data; Enter-top+; coutendl便道的num号车进入车场第; couttop位置.endl; cout请输入numt-reach.hourt-reach.min; W-head-next=q-next; if(q=W-rear) W-rear=W-head; Enter-stackEnter-top=t; delete q;else coutendl便道里没有车endl;else coutendl车场里没有车.top0) cout*endl; coutendl车场内部车辆停靠情况:endl; coutendl位置 到达时间 车牌号endl; for(i=1;itop;i+) couti; cout stacki-reach.hour:stacki-reach.min; cout stacki-numendl;else coutendl车场里没有车endl; cout*head-next; if(W-head!=W-rear) cout*endl; coutendl便道停靠车辆情况:endl;while(p!=NULL) coutendl车辆牌号：; coutdata-numnext; else coutendl便道里没有车.endl; cout*endl;void List(SeqStackCar S,LinkQueueCar W) /车辆列表显示函数 int flag,tag; flag=1;while(flag) cout*endl; cout车辆停靠查询开始：endl; coutendl请选择 1|2|3:endl; cout1.车场列表endl2.便道列表endl3.返回主菜单tag; if(tag=1|tag=3) break; els