c语言车辆管理系统课程设计

1、#in clude<stdio.h> #in clude<stdlib.h> #i ncludevstri ng.h>#defi ne MAX 3 /*车库容量 */#define price 0.5 /*每车每分钟费用*/typedef struct timeint hour;int min;Time; /* 时间结点*/typedef struct nodechar num10;Time reach;Time leave;CarNode;/* 车辆信息结点*/typedef struct NODECarNode *stackMAX + 1;int top;文档

2、资料WordMo ni_Cheku;typedef struct carCarNode *data;struct car *n ext;QueueNode;typedef struct NodeQueueNode *head;QueueNode *rear;Mon i_Bia ndao;初始化车库*/车辆到void In itStack(Mo ni_Cheku *); /* int Ini tQueue(Mo ni_Bia ndao *);/*初始化便道*/ int Arrival(Moni_Cheku *, Moni_Biandao *); /*达*/void Leave(Mo ni_Che

3、ku*, Mo ni_ChekuMon i_Bia ndao*); /*车辆离开*/void List(M on i_Cheku, Mo ni_Bia ndao); /*道的存车信息*/文档资料Word显示车库和便int mai n()Mon i_Cheku En ter, Temp;Mo ni_Bia ndao Wait;int ch;In itStack(&En ter); /*In itStack(&Temp); /*Ini tQueue(&Wait); /*printf(初始化车站*/初始化让路的临时链表初始化便道*/*/);printf( A_A欢迎进入停车场

4、管理系统1!A_An);printf();牰湩晴尨提示！ (1).该车库的最大容量为：d;n, MAX);printf( (2).该车库的收费标准为：4.2f元/ (辆*分钟).n,price);while (1) system(CLS);printf(*单菜主*n););车辆到达printf(.);printf( 2.车辆离开);pri ntf( 3.列表显示文档资料Wordprintf( 4. 退出系统 n);printf(*n );牰湩晴尨请选择(1-4): bb);while (1)sea nf(%d,&ch);if (ch >= 1 && ch <

5、= 4)break;汥敳瀠械瑮?错误！请重选(1-4): bb);switch (ch)case1:Arrival(&Enter,&Wait); break; /* 车辆到达 */case 2:Leave(&En ter, & Temp, &Wait); break; /*车辆离开*/case 3:List(Enter, Wait); break; /*打印列表信息 */case 4:exit(0); /*退出主程序 */default: break;return 0;文档资料Wordvoid InitStack(Moni_Cheku *s) /*初始化

6、车库 */int i;s->top = 0;for (i = 0; i <= MAX; i+)s->stacks->top = NULL;int InitQueue(Moni_Biandao *Q) /*初始化便道 */Q->head = (QueueNode *)malloc(sizeof(QueueNode);if (Q->head != NULL)Q->head-> next = NULL;Q->rear = Q->head;retur n(1);else return(-1);void PRINT(CarNode *p, in

7、t room) /*输出出库车的信息 */int A1, A2, B1, B2;文档资料Word牰湩晴尨请输入离开的时间：/*：*/);sea nf(%d:%d, &(p->leave.hour), &(p->leave. min);牰湩晴尨离开车辆的车牌号为:);puts(p->nu m);牰湩晴尨其到达时间为：%d:%dn, p->reaeh.hour,p->reaeh.mi n);牰湩晴尨离开时间为：%d:%dn, p->leave.hour,p->leave. min);A1 = p->reaeh.hour;A2 = p-

8、>reaeh. min;B1 = p->leave.hour;B2 = p->leave. min;牰湩晴尨应交费用为:%4.2f 元,(B1 - A1) * 60 + (B2 -A2)*price);free(p);int Arrival(M on i_Cheku *Enter, Mon i_Bia ndao *W) /*车辆到达*/CarNode *p;QueueNode *t;p = (CarNode *)malloc(sizeof(CarNode);fflush(stdin);牰湩晴尨请输入车牌号 ( 例如：中 CUG888):); scanf(%s,&(p-

9、>num);if (Enter->top < MAX) /* 车库未满，车进车库 */ Enter->top+;牰湩晴尨该车在车库位置 %d.n, Enter->top);牰湩晴尨请输入到达时间 (*:*):);scanf(%d:%d, &(p->reach.hour), &(p->reach.min);Enter->stackEnter->top = p;return(1);else /* 车库已满，车进便道 */牰湩晴尨该车须在便道等待 !n);t = (QueueNode *)malloc(sizeof(QueueNo

10、de);t->data = p;t->next = NULL;W->rear->next = t;W->rear = t;retur n(1);文档资料Wordvoid Leave(Mo ni_Cheku *En ter, Mon i_Cheku *Temp,Mon i_Bia ndao*W) /* 车辆离开*/int i, room;CarNode *p, *t;QueueNode *q;/*判断车库内是否有车*/if (En ter->top > 0) /*有车 */牰湩晴尨请输入车在车库的位置(1-%d): , Enter->top);/*

11、输入车辆离开的信息*/while (1)sea nf(%d, & room);if (room >= 1 && room <= En ter->top) break;汥敳瀠械瑮?错误!请重选：）；车辆离开*/while (En ter->top > room) /*文档资料WordTemp->top+;Temp->stackTemp->top=En ter->stackE nter->top;En ter->stackE nter->top = NULL;En ter->top-;p = En

12、 ter->stackE nter->top;En ter->stackE nter->top = NULL;En ter->top-;while (Temp->top >= 1)En ter->top+;En ter->stackE nter->top=Temp->stackTemp->top;Temp->stackTemp->top = NULL;Temp->top-;PRINT(p, room); /*判断通道上是否有车及车库是否已满*/if (W->head != W->rear) &

13、amp;& En ter->top < MAX) /*便道的车辆进入车库*/q = W->head->n ext;t = q->data;En ter->top+;文档资料Wordprintf(便道的%s号车进入车场第%d位置.,t->num,En ter->top);printf(请输入现在的时间(*:*):);sea nf(%d:%d,&(t->reach.hour),&(t->reach. min);W->head->n ext = q->n ext;if (q = W->rear

14、) W->rear = W->head;En ter->staekE nter->top = t;free(q);else printf(便道里没有车.n);汥敳瀠械瑮?车库里没有车！n); /* 没车*/void List1(Moni_Cheku *S) /*列表显示车库信息 */int i;if (S->top > 0) /*判断车库内是否有车*/牰湩晴尨车库号到达时间t 车牌号n);for (i = 1; i <= S->top; i+)printf( %d , i);文档资料Wordprintf( t%d:%d, S->stacki

15、->reach.hour, S->stacki->reach.mi n);printf(t%s n,S->stacki-> nu m);汥敳瀠械瑮?车库里没有车n);void List2(Moni_Biandao *W) /*列表显示便道信息 */QueueNode *p;p = W->head->n ext;if (W->head != W->rear) /*判断便道上是否有车*/牰湩晴尨在便道里等待的车辆的号码为：n);while (p != NULL)puts(p->data->nu m);p = p->n ext;汥敳瀠械瑮?便道里没有车.n);文档资料Wordvoid List(M on i_Cheku S, Mon i_Bia ndao W) int flag, tag;flag = 1;while (flag)printf(*查看 *、n)printf(. 车库2.便道3.返回n);printf(*n)；牰湩晴尨请选择(1-3): bb)