队列（Queue）是一种用于实现先进先出（FIFO）的数据结构，即第一个进入队列的数据排在队列的最前处，第二个进入队列的数据排在其后，依此类推；出队列时，总是排在队列最前处的那个数据先出队列。所以，先进队列的数据一定比后进队列的数据先出队列，这也就是所谓的先进先出。有多种方式可以用于队列的实现：可以用数组的形式实现顺序队列，也可以用链表的形式实现链式队列。-Queue (Queue) is a kind of used to implement the FIFO (FIFO) data structure, namely the first into the Queue of data in the Queue ahead of the row, in the second into the Queue data followed by, repeating　The queue, always row in the queue in the data before the first out queue. So, advanced queue data must be better than junior queue of data first out queue, this also is the so-called fifo. There are several ways to can be used for the realization of the queue: can use array of realize order queue, also can use the list of form realize chain queue.