#include <iostream> using namespace std; #include <list> //stl list是一雙向鏈表,可高效地進行插入刪除元素 #include <string> int main () { list<string> cc; list<string>::iterator pointCC; //iterator迭代器 cc.push_back("Chocolate"); cc.push_back("Strawberry"); cc.push_front("Lime"); cc.push_front("Vanilla"); cout << cc.size() << endl; for(pointCC=cc.begin();pointCC!=cc.end();++pointCC) { cout << *pointCC << endl; //遍歷list元素 } return 0; }