当前位置:网站首页>STL container
STL container
2022-07-05 01:50:00 【Porter hunter of the program】
A rough summary
stl Containers
cin>>s; Space , enter ,EOF end
getline(cin,s); The input line , The space does not end
length s.size();
Traverse :
for(int i=0;i<s.size();i++){
cout<<s[i];
}
Splicing :string t=”123”;
string s=”456”;
s=s+t;//s=”123456”;
s=s+”789”;//s=”123456789”;
s=”00”+s;//s=”00123456789”
Empty :s.clear();
s.empty();// If s If it is empty, the value is 1, Otherwise 0;
vector
One dimensional operation :
Definition :vector<int>v;Insert :v.push_back(1);
cout<<v[0];
Two dimensional operation :
vector< vector<int> > asd1;// Definition
For a one-dimensional array , have access to size() Get its length .
int size = asd.size();
For two dimensional arrays , You can use the following methods to get rows 、 Column length .
int size_row = asd1.size(); // Get the number of lines
int size_column = asd1[0].size(); // Get the number of columns
Direct assignment
asd1[1][1] = 1;
cout << asd1[1][1] <<endl;
asd1[1].push_back(23); // Insert column elements
asd1.push_back(asd); // Insert a row
Delete row :
auto test1 = asd1.begin();
asd1.erase(++test1);
Delete column :
auto test2 = test1.begin();
asd1[0].erase(++test2);
Traverse :
vector<vector<int> >::iterator p1;
vector<int>::iterator p2;
for (p1 = a.begin(); p1 != a.end(); p1++){
for (p2 = p1->begin(); p2 != p1->end(); p2++){
cout << "[" << *p2 << "]";
}
}
stack
stack<int>st;
First in, then out
Input :
st.push(1);// Add
Output :
st.top();// Output the first element of the stack
st.pop();// Delete the first element of the stack
Redefinition will automatically clear
while(cin>>n) stack<int>st;
queue
queue<int>q;
fifo
Input :
q.push(1);Output :
q.front();
q.pop();Priority queue
priority_queue<int>q;// Big root pile , null
Input :
q.push(1);Output :
q.top();
q.pop();priority_queue<int,vector<int>,greater<int>>tp;// Heap , Ascending sort
set To reorder
set<int>st;
st.insert();
*st.begin();// First element *st.end(); The last element
st.find(1);// Find out if there is 1 This element ;
st.count(1);// There are several elements 1;
multiset<int>st;// Don't reorder ;
map Array
map<int,string>mp;//int It's equivalent to a subscript ,string Equivalent to content
int and string The type of can be changed at will ;
mp[1]=”123”;
deque deque
deque<int>d;
iterator :
begin() Point to the position of the first element
end() Point to the position after the last element
rbegin() Point to a position before the first element
rend() Point to the last element position
Capacity dependent :
size() Returns the size of the container
max_size() Returns the maximum capacity of the container
empty() Judge whether the container is empty
resize() Change the size of the container
Member visit :
Use [ ] Access to , Use .at() Access to
front() Returns the first element
back() Return to the last element
Container adjustment :
assign Reassign elements to containers
push_back Insert the element... At the end of the container
push_front Insert the element... At the beginning of the element
pop_back Delete last element
pop_front Delete the beginning element
insert Inserts an element into the specified position , The return value is the iterator pointing to the last insertion position
erase Remove elements
swap Swap two containers
clear Empty the container
emplace Inserts an element into the specified position , Only a single element can be inserted
emplace_front Insert the element at the beginning of the container ( Efficient than push_front high )
emplace_back Insert the element at the end of the container
边栏推荐
- C basic knowledge review (Part 3 of 4)
- "2022" is a must know web security interview question for job hopping
- runc hang 导致 Kubernetes 节点 NotReady
- Interpretation of mask RCNN paper
- Luo Gu Pardon prisoners of war
- Educational Codeforces Round 122 (Rated for Div. 2) ABC
- R language uses logistic regression and afrima, ARIMA time series models to predict world population
- STM32 series - serial port UART software pin internal pull-up or external resistance pull-up - cause problem search
- Runc hang causes the kubernetes node notready
- R语言用logistic逻辑回归和AFRIMA、ARIMA时间序列模型预测世界人口
猜你喜欢
[swagger]-swagger learning
线上故障突突突?如何紧急诊断、排查与恢复
MySQL backup and recovery + experiment
Exploration and Practice of Stream Batch Integration in JD
Wechat applet: exclusive applet version of the whole network, independent wechat community contacts
官宣!第三届云原生编程挑战赛正式启动!
Li Kou Jianzhi offer -- binary tree chapter
如何做一个炫酷的墨水屏电子钟?
Express routing, express middleware, using express write interface
Blue Bridge Cup Square filling (DFS backtracking)
随机推荐
PHP 基础篇 - PHP 中 DES 加解密详解
Yyds dry inventory swagger positioning problem ⽅ formula
Pgadmin 4 V6.5 release, PostgreSQL open source graphical management tool
Hedhat firewall
STM32 series - serial port UART software pin internal pull-up or external resistance pull-up - cause problem search
Win: use shadow mode to view the Desktop Session of a remote user
Win:将一般用户添加到 Local Admins 组中
Application and development trend of image recognition technology
小程序容器技术与物联网 IoT 可以碰撞出什么样的火花
What is the length of SHA512 hash string- What is the length of a hashed string with SHA512?
Wechat applet; Gibberish generator
RichView TRVStyle MainRVStyle
Win:使用 PowerShell 检查无线信号的强弱
Interpretation of mask RCNN paper
JVM - when multiple threads initialize the same class, only one thread is allowed to initialize
Advanced conditional statements of common SQL operations
Exploration and practice of integration of streaming and wholesale in jd.com
Binary tree traversal - middle order traversal (golang)
Practice of tdengine in TCL air conditioning energy management platform
Wechat applet: Xingxiu UI v1.5 WordPress system information resources blog download applet wechat QQ dual end source code support WordPress secondary classification loading animation optimization