1.本演示程序的主要目的是由栈模拟停车场,以队列模拟车场外的便道,按照用户在终端的输入数据序列进行模拟管理.每一组输入数据包括三个数据项.汽车”到达”或”离去”信息”.汽车牌照号码以及到达或离去的时刻.对每一组输入数据进行操作后的输出信息为:若是车辆到达,则输出汽车在停车场内或便道上的停车位置 若是车辆离去,则输出汽车在停车场内停留的时间和应交纳的费用(在便道上不收费)

2.其中程序中需要别设一个栈,临时存放给要离去的汽车让路而从停车场退出的汽车,也有顺序存储结构实现.输入的数据按到达或离去的时刻有序.也就是要考虑第一个操作的时间都必须不同,后一个操作的时间要比前一个的靠后.

3.栈和队列的每一个元素表示一辆汽车.其中汽车包含两个数据项:汽车的号码和进入停车场的时刻.还要注意不能,同时存在两个号码相同的车.

-1. Demonstrating the procedure major objective originally is to simulate parking lot from the shed , simulates the external makeshift road of car park with the queue , manages according to that the consumer data-in array in the terminal carries out a simulation. Every group of data-in includes three data item. The automobile " is got to " or " leave " information ". Moment the licence plate number being got to as well as or leaving. The information carrying out the output handling the day afer tomorrow on every group of data-in is: On-position that the inner or the makeshift road gets on in parking lot if the vehicle gets to , exports then an automobile　If the vehicle leaves, be 2 export automobile time staying in parking lot inner and respond to the cost (do not charge on the makeshift road) paying. Need not to set up a shed in procedure among them , for a short time, store the automobile making way for the automobile needing to leave but withdrawing from from parking lot , also have