数据结构—停车管理系统.rar

#include #include #include #define MAX 2 #define price 0.05 typedef struct time{ int hour; int min; }Time; typedef struct node{ char num[10]; Time reach; Time leave; }CarNode; typedef struct NODE{ CarNode *stack[MAX+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 *,LinkQueue Car *); void Leave(SeqStackCar *,SeqStack *,LinkQueueCar *); void List(SeqStackCar,LinkQueueCar); Car *); void Leave(SeqStackCar *,SeqStack *,LinkQueueCar *); void List(SeqStackCar,LinkQueueCar);