c++ lists(链表)（C++ lists (linked list)）.docVIP

c++ lists(链表)（C++ lists (linked list)） C++ Lists (linked list) Lists stores elements in sequential lists. Compared to vectors (vectors), it allows fast insertion and deletion, but random access is slower The function list is as follows: Assign () assign the value to list Back () returns the last element Begin () returns the iterator pointing to the first element Clear () deletes all elements Empty () returns true if list is empty End () returns an iterator at the end Erase () deletes an element Front () returns the first element (get_allocator) configuration is returned to the list (insert) to insert an element into list Max_size () returns the maximum number of elements that list can hold Merge () merge two list (pop_back) to remove the last element (pop_front) to remove the first element Push_back () adds an element at the end of the list Push_front () adds an element to the head of list Rbegin () returns the reverse iterator pointing to the first element Remove () removes elements from list (remove_if) according to the specified conditions to remove elements Rend () points to the reverse iterator at the end of list Resize () changes the size of list Reverse (list) to reverse elements Size (list) returns the number of elements in the Sort () sort the list Splice () merge two list Swap () exchange two list (unique) remove duplicate elements in list ///////////////////////////////////////////////////////////////////////////////////// Function details Constructor constructors Explicit list (const A) (al = A); Explicit, list (size_type, N, const, T, v = T (), const, A, Al = A (); List (const, list, X); List (const_iterator, first, const_iterator, last, const, A, Al = A ()); The above four constructors in practice have the following situations: (1) (list) declared an empty list; (2) list (AL) declares an empty list, but it also stores a allocator object, al; (3) list (n) declares a list with n elements, each of which is constructed by its default constructor, T (); (4)