Search - parking lot queue

Search - parking lot queue - List

[Data structs] chechang DL : 0: 以栈摸拟停车场，以队列摸拟场外的车道，按照从终端读入的输入数据序列进行摸拟管理。每一组输入数据包括三个数据项：汽车到达或离去的信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若车辆到达，则输出汽车在停车场的内或便道上的位置，若车辆离去，则输出汽车在停车场内停留的时间和应交纳的引用。-Simulation in order to stack the car park to queue simulation outside lane, in accordance with the read from the terminal input data sequence management simulation. Each group of input data consists of three data items: the vehicles arrive at or leave the information, vehicle license number and arrival or departure time. For each group of input data to operate the output after the message is: if the arrival of the vehicles, then the output of motor vehicles in the parking lot or sidewalk on the location, if the vehicle left, the output of motor vehicles in the parking lot to stay within time and should be paid references.
Date : 2025-12-26 Size : 3kb User : chuyu1987
[Data structs] cheku DL : 0: 数据结构停车场管理栈和队列的应用双栈停车场便道问题-Car park management data structure of the application stack and queue issues dual stack parking lot pavement
Date : 2025-12-26 Size : 910kb User : 马飞
[Data structs] tcc DL : 0: 以栈模拟停车场，以队列模拟车场外的便道。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停车不收费）。栈以顺序存储结构实现，队列以链表结构实现。-Simulation of the car park to the stack to queue outside the road vehicle simulation. Input data for each group of three data items: auto " to" or " leave" information, vehicle license number and time of arrival or departure. Input data for each group to operate the output after the message is: If the arrival of the vehicles, while exports of motor vehicles in the parking lot or parking spaces on the sidewalk if the vehicle left, the output of motor vehicles in the parking lot to stay within time and should be paid The cost (in the pavement on the parking, no charge). Stack storage structure in order to achieve, a linked list queue structure.
Date : 2025-12-26 Size : 1kb User : XH
[Data structs] checha DL : 0: 以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。栈以顺序结构实现，队列以链表实现。-Simulation of car parks in order to stack to queue simulation sidewalk outside the car, in accordance with the read from the terminal sequence of the input data to simulate management.-Parking lot to stack simulation to simulate car off the sidewalk queue, in accordance with the input from the terminal read sequences simulated data management. Stack in order to achieve the structure, the queue to the list to achieve.-Simulation of car parks in order to stack to queue simulation sidewalk outside the car, in accordance with the read from the terminal sequence of the input data to simulate management.
Date : 2025-12-26 Size : 3kb User : sad
[Data structs] stackANDqueue DL : 0: 1. 用栈模拟停车场，队列模拟便道。停车场满的时候在便道排队，一旦有车开走，排在第一位的就进入停车场。 2. 当有车要开走的时候在它后面进入停车场的车先依次开出，待该车缴费离开后再依次回到停车场。 3. 离开停车场时应按时间缴纳费用，排队车辆进入停车场时也应该缴纳相应的排队费用。 4. 车辆到达时输出停车位置，离开时输出停留时间和应缴纳费用。 -1. With a stack simulation parking lot, queue simulation of pavement. Parking in the sidewalk when the full line up, once the car drove away, ranked first in the to enter the parking lot. 2. When a car to go to open it back into the car when the car first turn out, then turn out to be pay back to the car parking. 3. To leave the car park fees should be paid time, queuing of vehicles entering the car park should also line up to pay the appropriate fee. 4. Vehicle parking spaces to reach the output, leaving the output residence time and costs to be paid.
Date : 2025-12-26 Size : 2kb User : SUMMER
[Data structs] parking_do DL : 0: 以栈模拟停车场，以队列模拟车场外的便道。栈以顺序结构实现，队列以链表结构实现。- 源语言：中文▼目标语言：英语▼翻译文字或网页以栈模拟停车场，以队列模拟车场外的便道。栈以顺序结构实现，队列以链表结构实现。请键入文字或网站地址，或者上传文档。取消朗读将中文译成英语 Parking lot to stack simulation to simulate vehicle off the sidewalk queue. Structure in order to achieve the stack, the queue as a list structure to achieve.
Date : 2025-12-26 Size : 192kb User : liudong
[Data structs] shujujiegou--tingchechang DL : 0: 这是将队列和栈综合使用的一个程序，实现了停车场和等待停车队列的功能，可以方便管理停车场。-This is the integrated use of the queue and a stack of a program to achieve the parking lot and wait for the function of stopping the queue, you can easily manage parking.
Date : 2025-12-26 Size : 1kb User : xiaoyandong
[Data structs] Park DL : 0: 数据结构上机作业要求使用队列，实现停车场基本操作，原理较为简单~-Data structure requires the use of the queue on the machine operation, basic operation to achieve parking lot, the principle is simple ~
Date : 2025-12-26 Size : 7.29mb User : gq
[Data structs] Parking-Management-System DL : 0: 一个简单的停车场车辆进出管理程序，利用队列与栈的基本功能实现。-Vehicles entering and leaving the parking lot of a simple management procedures, the use of the basic functions of the queue and stack implementation.
Date : 2025-12-26 Size : 181kb User : 轩辰龙
[Data structs] Parking-lot-problems DL : 0: 关于停车场停车问题的管理，利用队列的性质就一辆车进停车场后的停车位，停车时间，需交停车费，以及停车场空闲车位的管理等问题-Questions about the management of parking lot, use queue of property is a car into the parking lot after the parking space, stop time, pay parking spot, and free parking management
Date : 2025-12-26 Size : 1kb User : 周春露
[Data structs] Parking-management-simulation-system DL : 0: 以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码及到达或离去的时刻，对每一组输入数据进行操作后的输出数据为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车离去；则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现，队列以链表实现。-Parking lot to stack simulation to simulate the queue of cars outside the sidewalk, according to the terminal read from the input data sequence to simulate management. Each set of input data consists of three data items: auto " to" or " leave" information, vehicle license number and arrival or departure time, for each group of input data to operate after the output data is: If the vehicle arrives , the output in a car park or car parking on the sidewalk location if the car away the output of cars in the parking lot of the duration and should pay the costs (time spent on the sidewalk of charge). Structure in order to achieve stack, queue linked list.
Date : 2025-12-26 Size : 4.38mb User : 李莹丽
[Data structs] 222 DL : 0: 实现停车场的基本进出问题，用栈和队列实现，若满栈则进队列等候-Parking lot and out to achieve the basic problem with the stack and queue implementations, if you enter the queue waiting for a full stack
Date : 2025-12-26 Size : 1kb User : 豆芽子
[Data structs] paking DL : 0: 设停车场是一个可停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次由北向南排列（大门在最南端，最先到达的在最北端），若停车场内已经停满n辆车，那么后来的车只能在场外等候，一旦有车开走，则等候在第一位的车即可开入（这是一个队列）；当停车场内某辆车需要开出，则在它之后的车辆必须给它让道，当这辆车驶出停车场后，其他车辆按序入栈。每辆车按时间收费。-The parking lot is a narrow channel n cars parking, and only one door available for car and out. Car in the parking lot, according to the order of the vehicle arrival time, in order from north to south arrangement (at the southernmost tip of the door, first to arrive in the North), if the parking lot full of parked n the car, then later the car only in the OTC waiting, once the car drove off, waiting to open into the first car (which is a queue) need out of a car in the parking lot, the vehicles behind it must give way to it, when this car drove out of the car park, the other vehicles in sequence onto the stack. The per vehicle fee on a time
Date : 2025-12-26 Size : 251kb User : yao
[Data structs] 123 DL : 0: 以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现。队列以链表结构实现-Stack simulation parking lot to the queue simulation car off the sidewalk, in accordance with the read from the terminal into the input data sequence to simulate management. Each set of input data including the three data items: car "arrived" or "leave" information, vehicle license number and the arrival or departure time. A set of input data to the output after the operation as follows: if the vehicle arrives at the output of the position of car parking in the parking lot or sidewalk if the vehicle to leave, then the output of cars in the parking lot of time to stay and should pay costs (stay on the sidewalk free of charge). Stack in the order of the structure. Queue to the list structure to achieve
Date : 2025-12-26 Size : 49kb User : 朱俊鹏
[Data structs] Parking DL : 0: 设停车场是一个可以停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次有北向南排列（大门在最南端，最先到达的第一车停放在车场的最北端），若车场内已停满n辆车，那么后来的车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该辆车开出大门外，其他车辆再按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。以栈模拟停车场，以队列模拟车场外的便道。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停车不收费）。栈以顺序存储结构实现，队列以链表结构实现。-Parking lots can be accommodated is a narrow channel of the n vehicles, and only one door available for car and out. Car in the parking lot, according to the order of the vehicle arrival time, turn north to south order (doors at the southernmost tip, the first to reach the first car parked in the yard of the North), if the car floor is full of parked n the car, then later cars can only wait on the sidewalk outside the door once the car drove off, then came in to open into the first car on the sidewalk when a car in the parking lot to leave behind it into the vehicle must to exit the yard to make way for it to be the car to open outside the gate, other vehicles and then the original order to enter the yard, per parked in the yard when it left the parking lot, the vehicle must pay the cost of the length of time it stays. Test for the simulation program management of the parking lot prepared according to the above requirements. Parking to stack simulation queue simulation car off the si
Date : 2025-12-26 Size : 1.24mb User : 卧龙
[Data structs] Parking-lot DL : 0: 利用栈和队列建立停车场，停车场中的车由栈储存，停车场外设置便道，便道上暂停的车由队列储存！-Use of stacks and queues build a parking lot, the car in the parking lot by the stack storage, parking settings sidewalk outside, the the suspended car on the sidewalk by the queue storage!
Date : 2025-12-26 Size : 4kb User : 李斌
[Data structs] Stack-and-queue DL : 0: 用visual c++实现的栈与队列的基本操作。以停车场为例，具有初始化停车场，添加车辆，车辆出停车场，显示所有车位细信息等功能。-With the basic operation of the stack and queue visual the c++ realization. In the parking lot as an example, with initialization parking lot, add the vehicle, the vehicle out of the parking lot, display all parking fine information and other functions.
Date : 2025-12-26 Size : 228kb User : 危育冰
[Data structs] Stack-Problem DL : 0: 栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。设每单位时间收费 1 元。-Parking Stack simulation to simulate the queue sidewalk outside the car, according to the read data the input terminal sequence simulation management. Output for each set of input data after the operation is as follows: If the vehicle arrives, the output of cars in the car park on the sidewalk or parking position if the vehicle away, the car output in the parking lot of the residence time and should pay costs (time spent on the sidewalk free of charge). Provided per unit time fee of $ 1.
Date : 2025-12-26 Size : 1.37mb User : 王丹
[Data structs] Parking DL : 0: 立体化停车场（东北大学数据结构课设）（1）采用栈、队列和有序表等数据结构。（2）等候车辆的管理。（3）地下、地面停车位的管理。（4）停车计费功能。 -Three-dimensional parking lot (Northeast University data structure set) (1) the use of stack, queue and ordered table and other data structures. (2) waiting for the management of the vehicle. (3) management of underground and ground parking spaces. (4) parking billing function.
Date : 2025-12-26 Size : 1.41mb User : 慕柯
[Data structs] DataStructure2 DL : 0: 设停车场是一个可停放n辆汽车的下狭长通道，且只有一个大门可供汽车进出，汽车在停车场内按车辆到达的时间先后排序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车厂的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该车开出大门外，其他车辆再按照原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制上述要求的管理模拟程序。(It simulates the parking lot by the stack, simulates the road outside the yard by the queue and simulates it according to the data sequence input from the terminal. Each set of input data includes three data items: the car "reach" or "leave" information, the license number of the car, and the arrival or departure time. The output information on the operation of each set of input data after: if the vehicle arrives, enter the parking position of motor vehicles in the parking lot or sidewalk; if the vehicle arrives, the output of motor vehicles in the parking lot or parking spaces on the sidewalk, if the vehicle left, then the output in the car in the parking lot to stay time and should be pay the costs (no fee stay on the sidewalk). The stack is implemented in a sequential structure, and the queue is implemented by a linked list structure.)
Date : 2025-12-26 Size : 11.19mb User : 嗨呀哈哈哈