c++ stl
作者:
turboDeng
,
2022-03-05 01:19:08
,
所有人可见
,
阅读 227
#include "iostream"
#include "vector"
#include "list"
#include "unordered_map"
#include "map"
#include "unordered_set"
#include "string"
#include "queue"
#include "algorithm"
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
int main()
{
cout<<"=========vector========="<<endl;
vector<int> vec;
vec.push_back(1);
vec.push_back(2);
vec.push_back(3);
cout<<vec.front()<<endl;
vec.insert(vec.begin()+2,66);
vec.erase(vec.begin()+2);
vec.pop_back();
reverse(vec.begin(),vec.end());
sort(vec.begin(),vec.end());
cout<<"vector大小"<<vec.size()<<endl;
vector<int>::iterator it;
for(it=vec.begin();it!=vec.end();it++)
cout<<*it<<endl;
cout<<"=======string==========="<<endl;
string str="hausthaust";
int cnt=count(str.begin(),str.end(),'h');
cout<<"h的数量:"<<cnt<<endl;
sort(str.begin(),str.end());
cout<<str<<endl;
cout<<"=========pair========="<<endl;
PII p[10];
for(int i=0;i<5;i++) p[i].x=p[i].y=100-i;
for(int i=0;i<5;i++) cout<<p[i].x<<" "<<p[i].y<<endl;
cout<<"=========map========="<<endl;
map<int,string> m;
m[1]="hello";
m[2]="world";
m.insert({3,"dxh"});
cout<<m.size()<<endl;
cout<<m[1]<<endl;
cout<<m[2]<<endl;
cout<<m[3]<<endl;
for(int i=1;i<=m.size();i++) cout<<m[i]<<" ";
return 0;
}