stack的小用法
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<list>
using namespace std;
int main(){
stack<int> stk;
stk.push(1);
stk.pop();
stk.push(222);
stk.push(3);
stk.push(24);
while(!stk.empty()){
cout << stk.top()<<endl;
stk.pop();
}
return 0;
}
list的小用法
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<list>
using namespace std;
int main(){
list<int> l;
l.push_back(1);
l.push_back(13);
for(int i = 0;i<10;i++)
l.push_back(rand()%20);
l.remove(1);
for(auto it = l.begin();it!=l.end();it++){
cout << *it<<endl;
}
}
vector的小用法
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<list>
using namespace std;
int main(){
vector<int> v;
v.push_back(1);
for(int i = 1;i<10;i++){
v.push_back(rand()%i);
}
cout << v.front();
for(auto iter = v.begin();iter!=v.end();iter++)
cout << *iter<<" ";
cout << "after sort is";
sort(v.begin(),v.end());
for(size_t i = 0;i<v.size() ;i++)
cout << v.at(i)<<" ";
}