1.　　所谓双端队列（double-ended queue，deque），就是在列表的两端都可以插入和删除数据。因此它允许的操作有Create、IsEmpty、IsFull、Left、Right、AddLeft、AddRight、DeleteLeft、DeleteRight。使用循环数组方式实现双端队列，要求实现上述操作，并实现一个Print输出操作，能将队列由左至右的次序输出于一行，元素间用空格间隔。队列元素类型设为整型。-Called deque (double-ended queue, deque), at both ends of the list can insert and delete data. Therefore, it allows the operating Create, IsEmpty, IsFull, Left, Right, AddLeft, AddRight, DeleteLeft, DeleteRight. Loop array deque, required to achieve the above-mentioned operation, and achieve a Print output operation, to be able to queue output by the left-to-right order of elements in a row, separated by spaces. Queue element type to integer.