STL-list的訪問與遍歷

#include"iostream"

#include"list"

#include"cstdlib"

using namespace std;

int main()

{

int ia[]={34,18,25,89,40,15,56,14,41,24};

listiList(ia,ia+10);

list::iterator it;

// cout<<"The begin:"<<iList.begin()<<endl;

cout<<"The first:"<<iList.front()<<endl;

cout<<"The last:"<<iList.back()<<endl;

it=iList.begin();

cout<<*it<<' '<<endl;

it++;

cout<<*it<<' '<<endl;

it++;

cout<<*it<<' '<<endl;

it--;

cout<<*it<<' '<<endl;

cout<<"........................."<<endl;

it=iList.end();

cout<<*it<<' '<<endl;

it--;

cout<<*it<<' '<<endl;

it++;

cout<<*it<<' '<<endl;

it++;

cout<<*it<<' '<<endl;

it++;

cout<<*it<<' '<<endl;

list::iterator end;

system("pause");

end=iList.end();

for(it=iList.begin();it!=end;it++)

cout<<*it<<' ';

cout<<endl;

system("pause");

return 0;//list貌似是環形的，end位爲空 

}