1     //动态数组 2     vector<int> theVector; 3     theVector.push_back(1); 4     theVector.push_back(2); 5     theVector.push_back(3); 6     theVector.pop_back(); 7     vector<int>::iterator itVector; 8     cout << "vector" << endl; 9     for(itVector = theVector.begin(); itVector != theVector.end(); itVector++)10     {11         cout << *itVector << endl;12     }13 14     //双向链表15     list<int> theList;16     theList.push_back(1);17     theList.push_front(2);18     list<int>::iterator itList;19     cout << "list" << endl;20     for(itList = theList.begin(); itList != theList.end(); itList++)21     {22         cout << *itList << endl;23     }24 25     //栈26     stack<int> theStack;27     theStack.push(1);28     theStack.push(2);29     theStack.push(3);30     theStack.pop();31     cout << "stack" << endl;32     while(!theStack.empty())33     {34         cout << theStack.top() << endl;35         theStack.pop();36     }37 38     //队列39     queue<int> theQueue;40     theQueue.push(1);41     theQueue.push(2);42     theQueue.push(3);43     theQueue.pop();44     cout << "queue" << endl;45     while(!theQueue.empty())46     {47         cout << theQueue.front() << endl;48         theQueue.pop();49     }50 51     //红黑树52     map<int, string, less<int> > theMap;//模版最后位置加空格53     theMap.insert(map<int, string, less<int> >::value_type(0,"Zero"));54     theMap.insert(map<int, string, less<int> >::value_type(1,"One"));55     theMap.insert(map<int, string, less<int> >::value_type(2,"Two"));56     map<int, string, less<int> >::iterator itMap;57     cout << "map" << endl;58     for(itMap = theMap.begin(); itMap != theMap.end(); itMap++)59     {60         cout << (*itMap).second << endl;61     }