C + + STL vector parsing (2)---"C + + STL" __c++

See more details: https://zcheng.ren/2016/08/23/STLVector/

In C + + because the array can not dynamically expand, so in the STL set vector to achieve the role of dynamic array, by allocating contiguous memory space to store elements, if the insertion of elements when the memory space is not large enough, you can reassign the memory to implement a dynamic array.
The vector's structure consists of 3 parts: The starting iterator that marks the starting point of the memory space: iterator start; an iterator that marks the insertion position of the current element: iterator finish; marks the actual end iterator for the actual allocation of memory termination: iterator End_of_ Storage
Iterator can be implemented through the element pointers because the elements in the vector are the same.
Attention:
1) Erase operation:

2 Insert operation:
。