Erase the last iterator position of the deleted element after deletion
int main () {///how to correctly delete all element loops int a[]={1,2,3,4,5,6,7,8,9};vector<int> V (a,a+6); for (vector<int>::iterator It=v.begin (); It!=v.end ();) {it=v.erase (it);} For (Vector<int>::iterator It=v.begin (); It!=v.end (); it++) {Cout<<*it<<endl;} Cout<<v.size () <<endl;getchar (); return 0;}
Reset elements and interchange elements
C.swap (C2)
C.assign (B,e)
C.assign (n,t) (iterators cannot be pointing to C)
Containers can grow automatically
Like a vector, the growth cost is bigger than the list.
Capacity () and reserve ()
Space larger than size is generally reserved, and when the memory has to be redistributed, the current capacity allocation policy is doubled
You can also assign a manual reserve (size)
Deque can be accessed randomly
P289
C + + Primer Note containers and algorithms (2)
