栈的操作(实验报告)(4)

while(1)

{scanf("%d",&ch);

if(ch>=1&&ch<=4)break;

else printf("\n请选择： 1|2|3|4.");

}

switch(ch)

{ case 1:Arrival(&Enter,&Wait);break; /*车辆到达*/

case 2:Leave(&Enter,&Temp,&Wait);break; /*车辆离开*/

case 3:List(Enter,Wait);break; /*列表打印信息*/

case 4:exit(0); /*退出主程序*/

栈的基本操作,附带源程序

default: break;

}}}

void InitStack(SeqStackCar *s) /*初始化栈*/

{ int i;

s->top=0;

for(i=0;i<=MAX;i++)

s->stack[s->top]=NULL;}

int InitQueue(LinkQueueCar *Q) /*初始化便道*/

{Q->head=(QueueNode *)malloc(sizeof(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 A1,A2,B1,B2;

printf("\n请输入离开的时间:/**:**/");

scanf("%d:%d",&(p->leave.hour),&(p->leave.min));

printf("\n离开车辆的车牌号为:");

puts(p->num);

printf("\n其到达时间为: %d:%d",p->reach.hour,p->reach.min);

printf("离开时间为: %d:%d",p->leave.hour,p->leave.min);

A1=p->reach.hour;

A2=p->reach.min;

B1=p->leave.hour;

B2=p->leave.min;

printf("\n应交费用为: %2.1f元",((B1-A1)*60+(B2-A2))*price);

free(p);

}

int Arrival(SeqStackCar *Enter,LinkQueueCar *W) /*车辆到达*/

{ CarNode *p;

QueueNode *t;

p=(CarNode *)malloc(sizeof(CarNode));

flushall();

printf("\n请输入车牌号(例:陕A1234):");

gets(p->num);

if(Enter->top<MAX) /*车场未满，车进车场*/

{Enter->top++;

printf("\n车辆在车场第%d位置.",Enter->top);

printf("\n请输入到达时间:/**:**/");

scanf("%d:%d",&(p->reach.hour),&(p->reach.min));

Enter->stack[Enter->top]=p;

return(1);}

else /*车场已满，车进便道*/