STL application (unfinished

Catalog

Container general functions ：

vector（ vector ） Basics ：

stack Basics

---

Container general functions ：

.size() The number of elements in the container

.empty() Judge whether the container is empty Return to one bool value （true/fault）

.front() Returns the first element of the container

.back() Returns the last element of the container

.begin() Pointer to the first element of the container

.end() Pointer to the next position of the last element of the container

.swap(b) Exchange the contents of two containers

::iterator() iterator

An iterator is a generalized pointer , It could be a pointer , It can also be an object that performs a pointer like operation on it. You can use an iterator to output vector The elements in :

for(vector<int>::interator it=a.begin();it!=a.end();it++) cout<<*it<<endl;

vector（ vector ） Basics ：

Constructors ：
a = vector(int) // Create an empty vector a,int type , The array name is a
a = vector(b) // copy constructor , Create a and b The same vector a                                                                  Create a 2D array ：vector<int>a[5] It's equivalent to creating 5 individual vector Each is an array
Additive elements ：
a.push_back(x) // To vector a Add an element to the tail X
a.insert(it, x) // To vector a Iterators in it Add elements in front X
Remove elements ：
a.pop_back() // Delete vector a The last element in
a.clear() // Empty vector a All elements in
a.erase(it) // Delete vector a Iterators in it Pointing elements
Get elements ：
a.front() // Get vector a The head element of
a.back() // Get vector a The tail element of
Acquisition iterator
a.begin() // Get vector a Iterator for the head of
a.end() // Get vector a Iterator of tail
Get vector information
a.empty() // Judgment vector a Is it empty
a.size() // Judgment vector a Size

stack Basics

 .stack<int>s Create a stack The type is int type

.push(x)  x Push

.pop() Stack top exit

.top() Reference the top of the stack

.empty() Is the stack empty If it is empty, return to true

.size() Stack size Returns the number of elements in the stack