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

time ( &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();Р}Р车辆离开函数,如果是最前面的车离开,后面的车必须都进行出栈操作进入到另一个栈中让需要离开的车离开后再重新进入;如果便道有车那么便道的前面的车即先入队的车进行出