用队列来实现机场的起飞和降落队列。队列是用链表结构封装后来实现的。

假设有一个每次前进一分钟的模拟时钟，对于每一分钟，产生两个在0-99内的随机数：如果第一个随机数小于landingRate*100，那么一个“着陆到达”将发生并被添加到着陆队列中；如果第二个随机数小于takeOffRate*100，那么一个“起飞到达”将发生并被添加到起飞队列中。接着，检查跑道是否空闲。若空闲，首先检查着陆队列是否为非空，如果是，允许第一架飞机着陆；否则，处理起飞队列

-With a queue to achieve airport takeoff and landing queue. A queue is a linked list structure encapsulates later achieve. Consider a one-minute time forward analog clock, for every minute, generates two random numbers within 0-99: If the first random number is less than landingRate* 100, then a " landing reaches the"　will occur and are Add the landing queue　if the second random number is less than takeOffRate* 100, then a " Arr"　will occur off and added to the queue. Then, check the runway is free. When idle, first check whether the non-empty queue landing, if so, to allow the first aircraft landing　Otherwise, the process takeoff queue