容器                           查询                                                                         插入

vector                        下标查询O(1)，值查询O(N)                                     O(N)

list                              O(N)                                                                       O(1) 

deque                        下标查询O(1)~O(N) ，值查询O(N)                          尾部O(1)， 头部O(n)            

map(set)                    log2(N)                                                                   log2(N)

hash                           最好O(1)，最坏O(n)                                                最好O(1)，最坏O(n) 

注：hash冲突解决不好，效率很低。 

deque：双端队列，支持首尾插入、删除，分段连续空间。各连续空间通过指针相连，是vector和list的结合概率。查询、删除效率都介于2者之间。