双端数组
构造函数
deque<T> depT;
deque(beg, end);
deque(n, elem);
deque(const deque &deq);
赋值操作
deque& operator=(const deque &deq);
assign(beg, end);
assign(n, elem);
deque大小操作
empty();
size();
resize(num);
resize(num, elem);
deque插入和删除
push_back(elem);
push_front(elem);
pop_back();
pop_front();
insert(pos, elem);
insert(pos, n, elem);
insert(pos, beg, end);
clear();
erase(beg, end);
erase(pos);
deque数据存取
at(int idx);
operator[];
front();
back();
deque排序
sort(iterator beg, iterator end);
