C++ Vectors（c++向量）.docVIP

C++ Vectors（c++向量） C++ Vectors Vector is part of the C++ standard template library, a versatile class of template classes and libraries that can manipulate a variety of data structures and algorithms. Vector is considered a container because it can store various types of objects like containers, simply, vector is able to store any type of dynamic array, and can increase the compression of data. In order to use vector, you must include the following code in your header file: #include vector Constructor. Vectors contains a series of contiguous storage elements that behave similarly to arrays. Any element access in Vector or add elements from the end can be done in constant time complexity, and find specific values of the element position or insert elements in Vector is linear time complexity. The function list is as follows: Constructors constructor Operators assigns or compares vector Assign () assignment of elements in Vector At () returns the element at the specified location Back () returns the last element Begin () returns the iterator of the first element Capacity () returns the number of elements that vector can hold (without redistributing memory) Clear () empty all elements Empty () to determine whether Vector is empty (empty when returning true) End () returns the iterator of the last element Erase () deletes the specified element Front () returns the first element Get_allocator () returns the memory allocator for vector Insert () inserts elements into Vector Max_size () returns the maximum number (upper limit) of the elements that Vector can hold Pop_back () removes the last element Push_back () adds an element at the end of Vector Rbegin () returns the reverse iterator at the tail of the Vector Rend () returns the inverse iterator of the Vector start Reserve () sets the minimum number of Vector elements to hold Resize () changes the number of Vector elements Size () returns the size of the number of Vector elements Swap () exchange two Vector /////////////