////////////////////////////////////////////////////////////////////////// ///author:Jeson Yang ///Date:2014.9.15 ////////////////////////////////////////////////////////////////////////// #include #include #include #include using namespace std; int _tmain(int argc, _TCHAR* argv[]) { ////////////////////////////////////////////////////////////////////////// //vector vector *vecInteger = new vector (); int num[10] = {1,2,3,4,5,6,7,8,9,10}; vecInteger->push_back(num[0]); vecInteger->push_back(num[1]); std::cout<<"iterator use way"< ::iterator it = vecInteger->begin(); it != vecInteger->end(); ++it) { std::cout<<*it< size(); i++) { cout<<*(vecInteger->begin() + i)< pop_back(); vecInteger->clear(); vecInteger->clear(); delete vecInteger; ////////////////////////////////////////////////////////////////////////// //map map *mapInteger = new map (); mapInteger->insert(pair ( 1, num[0])); mapInteger->insert(pair (2, num[1])); mapInteger->insert(map ::value_type(3, num[2])); for (map ::iterator it = mapInteger->begin(); it != mapInteger->end(); it++) { cout<<"it->first = "< first << "it->second = " < second< size(); i++) { cout<<(&mapInteger)[i]< ::iterator iter = mapInteger->find(1); if(iter != mapInteger->end()) { cout<<"Find, the value is "< second< clear(); delete mapInteger; ////////////////////////////////////////////////////////////////////////// //list list *listInteger = new list (); listInteger->push_back(num[0]); listInteger->push_back(num[1]); listInteger->push_front(num[2]); //list不要插入两个相同的元素,否则根据insert的描述可能出现问题 //listInteger->insert() for (list ::iterator it = listInteger->begin(); it != listInteger->end(); it++) { cout<<*it< ::iterator>(); for (int i = 0; i < listInteger->size(); i++) { //cout<<*(listInteger->begin() + i)< pop_back(); listInteger->pop_front(); listInteger->remove(num[1]); listInteger->clear(); delete listInteger; return 0; }