Detailed explanation of the usage of vector, queue and stack

vector Containers

vector Containers are similar to arrays , Storage space containing a continuous set of addresses . Yes vector You can query 、 Insert 、 Delete and other operations .
1.insert function
Three uses ：1.iterator insert(iterator loc,const TYPE &val);
2.void insert(iterator loc,size_type num,const TYPE &val);
3.void insert(iterator loc,input_iterator start,input_iterator end);
e.g:

vector<int>a;
a.insert(a.begin(),99);// Head elements 99
a.insert(a.end(),97);// Trailing element 97
a.insert(a.end(),4,5);// take 4 individual 5 Insert the tail 
a.push_back(10);// Additive elements 10 To vector The tail 
a.pop_back();// Delete the last element 
a.erase(number.begin());// Delete first element 
a.size();// return vector Number of current elements .
a.capacity();// return vector The number of elements it can hold .
a.empty();// Judge vector Is it empty .
a.front();// Returns the first number 
a.back();// Return to the last element 
a.clear();// Empty 
vector<int>number(5,99);
// structure number,5 The values are 99 The elements of 
vector<int>number1(number);
// structure number1, Copy number Containers 
vector<int>number2(number.begin(),number.end());
// structure number2, Copy number The value from the beginning to the end of the container 
for(int i=0;i<a.size();i++)
cout<<a[i]<<" ";// Output 
for(int i=0;i<a.size();i++)
cout<<a.at(i)<<endl;//at Function output is safer 
for(vector<int>::iterator i=a.begin();i!=a.end();i++)
cout<<*i<<endl;// Iterator output （ Equivalent to pointer ）
for(auto x:a) cout<<x<<" ";//C++11 The new grammar is more concise and efficient  

2. Array weight removal

#include<algorithm>//unique For its library function 
sort(a.begin(),a.end());// You have to sort 
a.erase(unique(a.begin(), a.end()), a.end()); // because unique The return value of the function is the subscript of the first repeating element , Therefore, you can clear the element from the return address to the end of the container .
// Remove duplicate numbers 

3. Support comparison operation

vector<int>a(3,4),b(4,3);
if(a>b) puts("a>b");
// Compare in dictionary order 

queue( queue )

queue ： fifo

queue<int>q;
q.push();// Insert elements... At the end of the team 
q.front();// Return to team leader element 
q.pop();// Pop up the header element 
q.back();// Return to the end of the team 
q.size();// Number of return elements 
q.empty();// Determine whether it is null 

priority_queue( Priority queue , Default large root heap )

#include<queue>
priority_queue<int>heap;// Default large root heap 
// Ascending queue , Small cap pile 
2 priority_queue <int,vector<int>,greater<int> > q;
3 // Descending queue , Big pile top 
4 priority_queue <int,vector<int>,less<int> >q;
heap.push();// Insert an element 
heap.top();// Return to the top of heap element 
heap.pop();// Pop up the top element 
heap.size();// Returns the number of elements in the queue 
heap.empty();//  Whether the queue is empty 

Can learn from the boss ： Add link description

stack( Stack )

#include<stack>
stack<int>a;
a.size();// Number of return elements 
a.empty();// Is the stack empty 
a.push();// Insert elements to the top of the stack 
a.top();// Back to top of stack element 
a.pop();// Pop up top element