#include <iostream>
#include <list>
#include <vector>
using namespace std;
int main ()
{
list<int> ilist(10,12);
int tmp[4] = {1,2,3,4};
list<int> ilist2(tmp,tmp+4);
list<int>::iterator iter;
ilist2.push_back(2);
ilist2.pop_back();
ilist2.push_front(3);
ilist2.pop_front();
iter=ilist2.begin(); //begin() is iterator
ilist2.erase(iter);//erase the iterator
int front_value = ilist2.front(); //front is an int value
ilist2.remove(front_value);//remove one element
for(iter=ilist2.begin();iter!= ilist2.end();iter++)
cout<<*iter<<" ";
cout<<endl;
ilist2.empty();
ilist2.clear();
front back
push_front |||||||||||||||||||||||||||||||||||||| push_back
| list |
pop_front |||||||||||||||||||||||||||||||||||||| pop_back
insert(iterator,number,value)
erase(iterator)
remove(value)
empty() clear() size()
sort() swap() unique()
//insert
vector<int> iv(2,10);
list<int> ilist3;
ilist3.insert(ilist3.begin(),iv.begin(),iv.end()); // 10 10
list<int>::iterator it=ilist3.begin();
it++; //it point to 2nd number
ilist3.insert(it,3,20); // 10 20 20 20 10
for(list<int>::iterator it=ilist3.begin();it!=ilist3.end();it++)
cout<<*it<<" ";
cout<<endl;
return 0;
}
STL_list
最新推荐文章于 2024-03-20 14:59:05 发布