栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码及到达或离去的时刻，对每一组输入数据进行操作后的输出数据为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车离去；则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现，队列以链表实现。-Stack simulation parking lot to the sidewalk outside the queue simulated vehicle, according to the input from the terminal read sequences simulated data management. Each set of input data consists of three data items: Automotive " reach"　or " leave"　information, license plate number and time of arrival or departure, for each set of input data, output data after the operation: If the vehicle arrives , the output in the car park or car parking on the sidewalk location　if the car away　the output of cars in the parking lot stay to be paid time and cost (time spent in the sidewalk without charge.) Structure in order to achieve the stack, the queue as a list implementation.