C++ STL

来源:互联网 发布:垃圾焚烧发电厂 知乎 编辑:程序博客网 时间:2024/05/21 10:08
#include <iostream>#include <map>#include <iterator>#include <string>#include <set>#include <vector>#include <list>using namespace std;string a[]={"hello","prime","plus"};string b[]={"how","are","you"};/*//mapint main(){    map<string,string> m;    int i;    m.clear();    for(i=0;i<3;i++)    m.insert(pair<string,string>(a[i],b[i]));    map<string,string>::iterator it;    it=m.find("hello");    if(it!=m.end())    {    }    for(it=m.begin();it!=m.end();it++)    cout<<it->first<<" "<<it->second<<endl;    return 0;}*//*//setint main(){    set<string> s;    int i;    for(i=0;i<3;i++)    s.insert(a[i]);    set <string>::iterator it;    it=s.find("hello");    if(it!=s.end())    {        s.erase(it);    }    for(it=s.begin();it!=s.end();it++)    cout<<*it<<endl;}*//*//vectorint main(){    vector<string>v;    vector<string>::iterator it;    it=v.begin();    int i;    for(i=0;i<3;i++)    v.push_back(a[i]);    for(i=0;i<v.size();i++)    cout<<v[i]<<endl;}*/int main(){    list<string> l;    l.clear();    int i;    for(i=0;i<3;i++)    l.push_back(a[i]); //如果用insert必须用迭代器    list<string>::iterator it;    for(it=l.begin();it!=l.end();it++)    cout<<*it<<endl;}