数据结构项目课程报告停车场管理系统.doc

安阳师范学院 ·数据结构项目课程·

数据结构项目课程报告

一、 问题描述及分析
题目要求:
设停车场内只有一个可停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车场的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后开入的车辆必须先退出车场为它让路，待该车辆开出大门外，其他车辆再按原次序进入车场，每辆车停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。
分析:
由题目只有一个大门进出并且“先到后处理”可知，应使构造栈模拟停车场，进入离开停车场即入栈出栈的过程；而便道等候的汽车符合“先到先处理”原则 ，应构造线性队列模拟；构造存储结构，存放车辆信息，车牌号，到达离开时间；通过time.h头文件中的函数获取汽车到来以及离开时间，利用时间差计算价钱。
主要模块如下图:
停车场管理系统
车辆到达停车场
车辆进入停车场
车辆离开停车场
车辆停留在便道
车辆进入停车场
输出车辆的进入信息
记录进入的时间位置
输出车辆的离开信息
记录车辆离开的时间位置
输出应缴纳的费用
便道的车辆进入停车场

二、 功能模块及数据结构描述
头文件、宏定义以及存储结构
结构体定义相关类型的链表空间有顺序栈的定义、链队、车辆信息结构体、时间计算结构体、车辆位置字符型结构体数组和循环单链表存储下一个地址空间。
#include
#include
#include
#include
#include

#define OK 1
#define ERROR 0

typedef struct time1
{
char times[100];
long time2;
}time1;

typedef struct node
{
char num[10];
time1 reach;
time1 leave;
}Car;

typedef struct Stack
{
Car *stack[100];
int top;
}SqStack;

typedef struct car
{
Car *data;
struct car *next;
}QNode;

typedef struct Node

{
QNode *front;
QNode *rear;
}LinkQueue;

主函数
void main()
{
SqStack In, Out;
LinkQueue Wait;
int ch;
int MAX;
float price;
printf("请输入停车场的容量:");
scanf("%d", &MAX);
printf("请输入停车场的收费标准(元 / 小时) :");
scanf("%f", &price);
InitStack(&In, MAX);
InitStack(&Out, MAX);
InitQueue(&Wait);
while (1)
{
system("color 0A");
printf(" == == == = 欢迎使用停车场管理系统 == == == == == == == == == == \n");

printf("输入的停车场容量为%d位，费用为%2.1f元 / 小时, 请按任意键进入系统", MAX, price);
getchar();
system("CLS");
printf(" == == == = 欢迎使用停车场管理系统 == == == == == == == == == \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == = \n");
printf("(1)车辆到达\n(2)车辆离开\n(3)停车场信息\n(4)退出系统\n请选择\n");
printf("\n == == == == == == == == == == == == == = \n");
while (1)
{
printf("请输入操作的序号");

scanf("%d", &ch);
switch (ch)
{
case 1:
arrive(&In, &Wait, MAX, price);
break;
case 2:
leave(&In, &Out, &Wait, MAX, price);
break;
case 3:
info(In, Wait);
break;
case 4:
{
system("CLS");
printf("\n == == == == == == == == == == == == == == \n");
printf(" 谢谢使用!\n");
printf("\n == == == == == == == == == == == == == == == == == == == == = \n");
exit(0);
}
default:printf("\n按键无效，请重新按键选择");
getchar();
}
system("CLS");
printf(" == == == == == 欢迎使用停车场管理系统 == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == \n");
printf("(1)车辆到达\n(2)车辆离开\n(3)停车场信息\n(4)退出系统\n请选择\n");
printf("\n == == == == == == == == == == == == == == == == == == == == == \n");
}
}
}

费用计算函数，通过时间差计算费用
void print(Car *p, int room, int MAX, float price)
{
time_t rawtime;
struct tm * timeinfo;
long A1, A2, B1, B2;
time ( &rawtime );
timeinfo = localtime ( &rawtime );
p->leave.time2=rawtime;
printf("\n车离开的时间为:%s ",asctime (timeinfo));
strcpy(p->leave.times,asctime (timeinfo));
printf("\n车牌号码:");
puts(p->num);
printf("\n车到达的时间是: %s ", p->reach.times);
printf("\n车离开的时间是: %s ", p->leave.times);
A1=p->leave.time2;
A2=p->reach.time2;
B1=p->leave.time2-p->reach.time2;
if(B1<=3600&&B1>=0)
printf("\n费用为: %2.1f元", price);
else
printf("\n费用为: %2.1f元", B1/3600*price);
free(p);
}//消费计算函数

车辆到达函数，获取车辆信息，判断是否有车位，进行入栈或入队操作
int arrive(SqStack *In, LinkQueue *W, int MAX, float price)
{
Car *p;
QNode *t;
time_t rawtime;
struct tm * timeinfo;
//time ( &rawtime ); // 获取时间，以秒计，从1970年1月一日起算，存于rawtime
//timeinfo = localtime ( &rawtime ); //转为当地时间，tm 时间结构
//printf ( "当前系统时间: %s", asctime (timeinfo) );
//asctime (timeinfo); // 转为标准ASCII时间格式：
p = (Car *)malloc(sizeof(Car));
printf(" == == == == == == == == == == = 欢迎使用停车场管理系统 == == == == == == == == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时\n", MAX, price);
printf("停车场还有%d停车位, 车可先进入便道等待", MAX - In->top);
printf("\n请输入车牌号码(例:警A1035) :");
getchar();
scanf("%s", p->num);
getchar();
if (In->top < MAX)
{
time ( &rawtime );
p->reach.time2=rawtime;
timeinfo = localtime ( &rawtime );
In->top++;
printf("停车的位置:%d号停车位。", In->top);
printf("\n车到达的时间为%s: ",asctime (timeinfo));
strcpy(p->reach.times,asctime (timeinfo));
In->stack[In->top] = p;
printf("请按任意键返回\n");
printf("\n == == == == == == == == == == == == == == == == == == == == == == == \n");
getchar();
return OK;
}
else
{
printf(" == == == == = 欢迎使用停车场管理系统 == == == == == == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == = \n");
printf("停车位已满，该车须在便道等待！");
t = (QNode *)malloc(sizeof(QNode));
t->data = p;
t->next NULL;
W->rear->next = t;
W->rear = t;
printf("\n请按任意键返回");
getchar();
return OK;
}
getchar();
}

车辆离开函数，如果是最前面的车离开，后面的车必须都进行出栈操作进入到另一个栈中让需要离开的车离开后再重新进入；如果便道有车那么便道的前面的车即先入队的车进行出队入栈
void leave(SqStack *In, SqStack *Out, LinkQueue *W, int MAX, float price)
{
int place;
Car *p, *t;
QNode *q;
time_t rawtime;
struct tm * timeinfo;
system("CLS");
if (In->top>0)
{
while (1)
{
printf(" == == == == 欢迎使用停车场管理系统 == == == == == == == == == \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == == == == == = \n");
printf("请输入车在停车场的位置(1 - %d)：", In->top);
scanf("%d", &place);
if (place >= 1 && place <= In->top) break;
}
while (In->top>place)
{
Out->top++;
Out->stack[Out->top] = In->stack[In->top];
In->stack[In->top] = NULL;
In->top--;
}
p = In->stack[In->top];
In->stack[In->top] = NULL;
In->top--;
while (Out->top >= 1)
{
In->top++;
In->stack[In->top] = Out->stack[Out->top];
Out->stack[Out->top] = NULL;
Out->top--;
}
print(p, place, MAX, price);
if ((W->front != W->rear) && In->topfront->next;
t = q->data;
In->top++;
printf("\n便道的%s号车进入车场第%d号停车位。", t->num, In->top);
printf("\n车到达的时间: %s ",asctime (timeinfo));
t->reach.time2=rawtime;
strcpy(t->reach.times,asctime (timeinfo));
W->front->next = q->next;
if (q == W->rear) W->rear = W->front;
In->stack[In->top] = t;
free(q);
}
}
else
printf("\n == == == == == == == == == == == == == == == == == == == == == == == == = \n");
printf("停车场里没有车\n");
printf("\n请按任意键返回");
printf("\n\n == == == == == == == == == == == == == == == == == == == == == == == == = \n");
getchar();
getchar();
}
停车场信息函数，遍历队列和栈能知道便道中和停车场中车辆信息
void info1(SqStack *S)
{
int i;
if (S->top>0)
{
printf("\n 停车场\n");
for (i = 1; i <= S->top; i++)
{
printf("\n 位置: \n %d\n", i);
printf(" 到达时间:\n%s 车牌号: \n %s\n", S->stack[i]->reach.times,S->stack[i]->num);
}
}
else
{
printf("\n == == == == == == == == == == == == == == == == == == == == = \n");
printf("停车场里没有车");
}
}
void info2(LinkQueue *W)
{
QNode *p;
p = W->front->next;
if (W->front != W->rear)
{
printf("\n便道中车辆的号码为:\n");
while (p != NULL)
{
printf("%s\n", p->data->num);
p = p->next;
}

}
else printf("\n便道里没有车\n");
printf("\n请按任意键返回\n");
printf("\n\n == == == == == == == == == == == == == == == == == == == == == \n");
getchar();
}

void info(SqStack S, LinkQueue W)
{
system("CLS");
info1(&S);
info2(&W);
getchar();
}

队列和栈的初始化
void InitStack(SqStack *s, int MAX)
{
int i;
s->top = 0;
for (i = 0; i <= MAX; i++)
s->stack[s->top] = NULL;
}
int InitQueue(LinkQueue *Q)
{
Q->front = (QNode *)malloc(sizeof(QNode));
if (Q->front != NULL)
{
Q->front->next = NULL;
Q->rear = Q->front;
return OK;
}
else return ERROR;
}//队列和栈初始函数

三、 主要算法流程描述及部分核心算法
流程描述
1.车辆到达停车场
其中车辆到达时需要用户输入车辆信息，接着要判断栈是否已满，如当前栈未满，则进行入栈操作，即车辆进入停车场；如果栈已满，则车辆必须进入便道等待。
2. 车辆进入停车场
车辆进入，则进行入栈操作，即将车辆信息结点进行入栈操作。
3. 车辆离开停车场
车辆的离开，则需要另设一个栈，给离去的汽车让路而从停车场退出来的汽车临时停放，也用顺序栈实现，车辆离开后需检查便道内是否有车辆等待，若有等待车辆则进行便道内的车辆进入停车场的操作，即将车辆信息结点进行入栈操作，输入当前时间后开始计费，最后进行出队操作，表示车辆已离开便道。

核心算法
车辆到达停车场

获取车辆到达时间

是

车辆进入停车场
开 始
记录车辆信息和到达时间
判断是否重复有车辆
否
是
储存车辆信息和时间信息
结 束

车辆离开停车场
开 始
获取车辆离开信息和时间
计算时间差运算停车费用
判断便道中是否有车
否
输出离开停车场信息和收费金额
车辆离开停车场更新栈表
结 束
是
输出车辆现在停止在便道位置
等待车辆离开

四、 系统使用说明
运行环境为VC++6.0，如果需要在VS上运行需要改动scanf函数为scanf_s
运行截图

附:源码
#include
#include
#include
#include
#include

#define OK 1
#define ERROR 0

typedef struct time1
{
char times[100];
long time2;
}time1;

typedef struct node
{
char num[10];
time1 reach;
time1 leave;
}Car;

typedef struct Stack
{
Car *stack[100];
int top;
}SqStack;

typedef struct car
{
Car *data;
struct car *next;
}QNode;

typedef struct Node
{
QNode *front;
QNode *rear;
}LinkQueue;

void print(Car *p, int room, int MAX, float price);
int arrive(SqStack *In, LinkQueue *W, int MAX, float price);
void leave(SqStack *In, SqStack *Out, LinkQueue *W, int MAX, float price);
void info1(SqStack *S);
void info2(LinkQueue *W);
void info(SqStack S, LinkQueue W);
void InitStack(SqStack *s, int MAX);
int InitQueue(LinkQueue *Q);

void main()
{
SqStack In, Out;
LinkQueue Wait;
int ch;
int MAX;
float price;
printf("请输入停车场的容量:");
scanf("%d", &MAX);
printf("请输入停车场的收费标准(元 / 小时) :");
scanf("%f", &price);
InitStack(&In, MAX);
InitStack(&Out, MAX);
InitQueue(&Wait);
while (1)
{
system("color 0A");
printf(" == == == = 欢迎使用停车场管理系统 == == == == == == == == == == \n");

printf("输入的停车场容量为%d位，费用为%2.1f元 / 小时, 请按任意键进入系统", MAX, price);
getchar();
system("CLS");
printf(" == == == = 欢迎使用停车场管理系统 == == == == == == == == == \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == = \n");
printf("(1)车辆到达\n(2)车辆离开\n(3)停车场信息\n(4)退出系统\n请选择\n");
printf("\n == == == == == == == == == == == == == = \n");

while (1)
{
printf("请输入操作的序号");

scanf("%d", &ch);
switch (ch)
{
case 1:
arrive(&In, &Wait, MAX, price);
break;
case 2:
leave(&In, &Out, &Wait, MAX, price);
break;
case 3:
info(In, Wait);
break;
case 4:
{
system("CLS");
printf("\n == == == == == == == == == == == == == == \n");
printf(" 谢谢使用!\n");
printf("\n == == == == == == == == == == == == == == == == == == == == = \n");
exit(0);
}
default:printf("\n按键无效，请重新按键选择");
getchar();
}
system("CLS");
printf(" == == == == == 欢迎使用停车场管理系统 == == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == \n");
printf("(1)车辆到达\n(2)车辆离开\n(3)停车场信息\n(4)退出系统\n请选择\n");
printf("\n == == == == == == == == == == == == == == == == == == == == == \n");
}
}
}
//主函数菜单
void print(Car *p, int room, int MAX, float price)
{
time_t rawtime;
struct tm * timeinfo;
long A1, A2, B1, B2;
time ( &rawtime );
timeinfo = localtime ( &rawtime );
p->leave.time2=rawtime
printf("\n车离开的时间为:%s ",asctime (timeinfo));
strcpy(p->leave.times,asctime (timeinfo));
printf("\n车牌号码:");
puts(p->num);
printf("\n车到达的时间是: %s ", p->reach.times);
printf("\n车离开的时间是: %s ", p->leave.times);
A1=p->leave.time2;
A2=p->reach.time2;
B1=p->leave.time2-p->reach.time2;

if(B1<=3600&&B1>=0)
printf("\n费用为: %2.1f元", price);
else
printf("\n费用为: %2.1f元", B1/3600*price);
free(p);
}//消费计算函数

int arrive(SqStack *In, LinkQueue *W, int MAX, float price)
{
Car *p;
QNode *t;
time_t rawtime;
struct tm * timeinfo;
//time ( &rawtime ); // 获取时间，以秒计，从1970年1月一日起算，存于rawtime
//timeinfo = localtime ( &rawtime ); //转为当地时间，tm 时间结构
//printf ( "当前系统时间: %s", asctime (timeinfo) ); //asctime (timeinfo); // 转为标准ASCII时间格式：
p = (Car *)malloc(sizeof(Car));
printf(" == == == == == == == == == == = 欢迎使用停车场管理系统 == == == == == == == == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("停车场还有%d停车位, 车可先进入便道等待", MAX - In->top);
printf("\n请输入车牌号码(例:警A1035) :");
getchar();
scanf("%s", p->num);
getchar();
if (In->top < MAX)
{
time ( &rawtime );
p->reach.time2=rawtime;
timeinfo = localtime ( &rawtime );
In->top++;
printf("停车的位置:%d号停车位。", In->top);
printf("\n车到达的时间为%s ",asctime (timeinfo));
strcpy(p->reach.times,asctime (timeinfo));
In->stack[In->top] = p;
printf("请按任意键返回\n");
printf("\n == == == == == == == == == == == == == == == == == == == == == == == \n");
getchar();
return OK;
}
else
{
printf(" == == == == = 欢迎使用停车场管理系统 == == == == == == == == = \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == = \n");
printf("停车位已满，该车须在便道等待！");
t = (QNode *)malloc(sizeof(QNode))
t->data = p;
t->next = NULL;
W->rear->next = t;
W->rear = t;
printf("\n请按任意键返回");
getchar();
return OK;
}
getchar();
}

void leave(SqStack *In, SqStack *Out, LinkQueue *W, int MAX, float price)
{
int place;
Car *p, *t;
QNode *q;
time_t rawtime;
struct tm * timeinfo;
system("CLS");
if (In->top>0)
{
while (1)
{
printf(" == == == == 欢迎使用停车场管理系统 == == == == == == == == == \n");
printf("您输入的停车场容量为%d位，费用为%2.1f元 / 小时。\n", MAX, price);
printf("\n == == == == == == == == == == == == == == == == == == == == == == == == == = \n");
printf("请输入车在停车场的位置(1 - %d)：", In->top);
scanf("%d", &place);
if (place >= 1 && place <= In->top) break;
}
while (In->top>place)
{
Out->top++;
Out->stack[Out->top] = In->stack[In->top];
In->stack[In->top] = NULL;
In->top--;
}
p = In->stack[In->top];
In->stack[In>top] = NULL;
In->top--;
while (Out->top >= 1)
{
In->top++;
In->stack[In->top] = Out->stack[Out->top];
Out->stack[Out->top] = NULL;
Out->top--;
}
print(p, place, MAX, price);
if ((W->front != W->rear) && In->toptime ( &rawtime );
q = W->front->next;
t = q->data;
In->top++;
printf("\n便道的%s号车进入车场第%d号停车位。", t->num, In->top);
printf("\n车到达的时间: %s ",asctime (timeinfo));
t->reach.time2=rawtime;
strcpy(t->reach.times,asctime (timeinfo));
W->front->next = q->next;
if (q ==