List是双链表，所以很容易插入和删除一个元素。我们只需要改变这几个指针，而在向量中如果我们想在中间插入一个元素那么它后面的每个元素都要移动一个下标。此外，如果向量的大小已满，那么它必须首先增加它的大小。所以这是一个昂贵的手术。 因此，在这种情况下，只要需要更频繁地执行插入和删除操作，就应该使用案例列表。

当你想在容器之间移动对象时，你可以使用list::splice。

例如，一个图划分算法可以将常数数量的对象递归地划分到数量不断增加的容器中。对象应该初始化一次，并始终保持在内存中的相同位置。通过重新链接来重新排列比重新分配要快得多。

Edit: as libraries prepare to implement C++0x, the general case of splicing a subsequence into a list is becoming linear complexity with the length of the sequence. This is because splice (now) needs to iterate over the sequence to count the number of elements in it. (Because the list needs to record its size.) Simply counting and re-linking the list is still faster than any alternative, and splicing an entire list or a single element are special cases with constant complexity. But, if you have long sequences to splice, you might have to dig around for a better, old-fashioned, non-compliant container.

List是双链表，所以很容易插入和删除一个元素。我们只需要改变这几个指针，而在向量中如果我们想在中间插入一个元素那么它后面的每个元素都要移动一个下标。此外，如果向量的大小已满，那么它必须首先增加它的大小。所以这是一个昂贵的手术。 因此，在这种情况下，只要需要更频繁地执行插入和删除操作，就应该使用案例列表。

如果你不需要经常插入元素，那么向量会更有效。它具有比列表更好的CPU缓存位置。换句话说，访问一个元素使得下一个元素很有可能存在于缓存中，并且可以在不读取慢速RAM的情况下被检索。

想要重复将大量项插入序列末尾以外的任何位置的情况。

看看每种不同类型的容器的复杂度保证:

标准容器的复杂性保证是什么?

在向量和列表的情况下，对我来说，主要的区别如下:

向量

A vector stores its elements in contiguous memory. Therefore, random access is possible inside a vector which means that accessing an element of a vector is very fast because we can simply multiply the base address with the item index to access that element. In fact, it takes only O(1) or constant time for this purpose. Since a vector basically wraps an array, every time you insert an element into the vector (dynamic array), it has to resize itself by finding a new contiguous block of memory to accommodate the new elements which is time-costly. It does not consume extra memory to store any pointers to other elements within it.

list

A list stores its elements in non-contiguous memory. Therefore, random access is not possible inside a list which means that to access its elements we have to use the pointers and traverse the list which is slower relative to vector. This takes O(n) or linear time which is slower than O(1). Since a list uses non-contiguous memory, the time taken to insert an element inside a list is a lot more efficient than in the case of its vector counterpart because reallocation of memory is avoided. It consumes extra memory to store pointers to the element before and after a particular element.

因此，记住这些区别，我们通常会考虑内存、频繁的随机访问和插入来决定给定场景中向量和列表的胜者。