C++面试题之容器

标准模板库＝＝头文件＝＝#ifndef PRINT_H#define PRINT_H 1//输出一个指定区间中的所有数据（含头不含尾）#include <iostream>using namespace std;template <typename T>void print(T b,T e,char c=' '){while(b!=e)cout<<*b++<<c;cout<<endl;}#endif-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-/*标准容器（类模板）共性：构造函数：无参构造，拷贝构造，区间构造（两个迭代器表示的两个位置）析构：迭代器相关：正向.begin(), .end(), 反向.rbegin(), .rend()iterator,reverse_iterator,const_iterator,const_reverse_irerator* -> = ++ == != --插入：isert(pos,element),其中pos表示插入为位置，是一个迭代器删除：.erase(pos), erase(pos_beg,pos_end)清除：.clear()大小：.size(), .max_size(), .empty()交换：.swap(c2), swap(c1,c2)运算符：= > < >= <= == !=*/#include <iostream>#include <vector>#include <algorithm>using namespace std;#include "print.h"int main(){int a[5]={33,11,55,22,44};vector<int> vi(a,a+5);//创建一个数据空间cout<<vi.size()<<endl;sort(vi.begin(),vi.end());vector<int>::iterator b=vi.begin();while(b!=vi.end())cout<<*b++<<' ';cout<<endl;for(int i=0;i<5;i++)cout<<a[i]<<' ';cout<<endl;print(vi.begin(),vi.end());print(a,a+5); print(vi.rbegin(),vi.rend());b=vi.begin();vi.insert(++++b,66);//在指定位置插入数据vi.insert(vi.begin(),77); vi.insert(vi.end(),88);print(vi.begin(),vi.end());cout<<vi.size()<<'/'<<vi.max_size()<<endl;vi.erase(------vi.end());//删除指定位置的元素print(vi.begin(),vi.end());vi.erase(++++vi.begin(),--vi.end());//删除区间print(vi.begin(),vi.end());vector<int> v2(a,a+5);print(v2.begin(),v2.end());vi.swap(v2);cout<<"---------------------------"<<endl;print(vi.begin(),vi.end());print(v2.begin(),v2.end());swap(vi,v2);cout<<"---------------------------"<<endl;print(vi.begin(),vi.end()); print(v2.begin(),v2.end());vector<int> t=vi; vi=v2; v2=t;cout<<"========================="<<endl;print(vi.begin(),vi.end()); print(v2.begin(),v2.end());vi.clear();cout<<vi.size()<<endl;print(vi.begin(),vi.end());vector<int> x;cout<<"vector当前容量："<<x.capacity()<<endl; }/*511 22 33 44 5533 11 55 22 4411 22 33 44 5533 11 55 22 4455 44 33 22 1177 11 22 66 33 44 55 888/107374182377 11 22 66 33 55 8877 11 8833 11 55 22 44---------------------------33 11 55 22 4477 11 88---------------------------77 11 8833 11 55 22 44=========================33 11 55 22 4477 11 88vector当前容量：0*/-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-vector容器共性#include <iostream>#include <vector>#include <algorithm>using namespace std;#include "print.h"int main(){int a[5]={33,11,55,22,44};vector<int> vi(a,a+5);//创建一个数据空间cout<<vi.size()<<endl;sort(vi.begin(),vi.end());vector<int>::iterator b=vi.begin();while(b!=vi.end())cout<<*b++<<' ';cout<<endl;for(int i=0;i<5;i++)cout<<a[i]<<' ';cout<<endl;print(vi.begin(),vi.end());print(a,a+5);print(vi.rbegin(),vi.rend());b=vi.begin();vi.insert(++++b,66);//在指定位置插入数据vi.insert(vi.begin(),77);vi.insert(vi.end(),88);print(vi.begin(),vi.end());cout<<vi.size()<<'/'<<vi.max_size()<<endl;vi.erase(------vi.end());//删除指定位置的元素print(vi.begin(),vi.end());vi.erase(++++vi.begin(),--vi.end());//删除区间print(vi.begin(),vi.end());vector<int> v2(a,a+5);print(v2.begin(),v2.end());vi.swap(v2);cout<<"---------------------------"<<endl;print(vi.begin(),vi.end());print(v2.begin(),v2.end());swap(vi,v2);cout<<"---------------------------"<<endl;print(vi.begin(),vi.end());print(v2.begin(),v2.end());vector<int> t=vi;vi=v2;v2=t;cout<<"========================="<<endl;print(vi.begin(),vi.end());print(v2.begin(),v2.end());vi.clear();cout<<vi.size()<<endl;print(vi.begin(),vi.end());vector<int> x;cout<<"vector当前容量："<<x.capacity()<<endl; }/*511 22 33 44 5533 11 55 22 4411 22 33 44 5533 11 55 22 4455 44 33 22 1177 11 22 66 33 44 55 888/107374182377 11 22 66 33 55 8877 11 8833 11 55 22 44---------------------------33 11 55 22 4477 11 88---------------------------77 11 8833 11 55 22 44=========================33 11 55 22 4477 11 88vector当前容量：0*/-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-/*序列式容器的共性：vector,deque,list构造函数：插入：.insert(pos,element),.insert(pos,pos_beg,pos_end)//在pos处插入一个区间的数据赋值：.assign(n,element), .assign(pos_beg,pos_end)调整：.resize(n,element=零初始化)首尾：.front(), .back() //取出首尾的值增删：.push_back(element), .pop_back()只删除，返回void*/#include <iostream>#include <deque>#include <string>using namespace std;#include "print.h"int main(){deque<string> ds;//deque< vector<int> >ds.push_back("郭靖");ds.push_back("黄蓉");ds.push_back("杨过");ds.push_back("小龙女");print(ds.begin(),ds.end(),',');ds.insert(++++ds.begin(),2,"张无忌");print(ds.begin(),ds.end(),',');string s[3]={"乔峰","虚竹","段誉"};ds.insert(----ds.end(),s,s+3);//在----ds.end()处插入s到(s＋3)的数据print(ds.begin(),ds.end(),',');ds.pop_back();ds.pop_back();//两次从末尾删除一个元素print(ds.begin(),ds.end(),',');cout<<"front:"<<ds.front()<<",back:"<<ds.back()<<endl;ds.resize(12,"东邪");print(ds.begin(),ds.end(),',');ds.assign(5,"西毒");//给ds赋值(会覆盖原值)print(ds.begin(),ds.end(),',');ds.front()="南帝";ds.back()="北丐"; //front()和back()返回的是原数据的引用，可以直接修改print(ds.begin(),ds.end(),',');}-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-/*vector的个性：当前容量：.capaicty()取得目前已经分配的空间能放多少元素约定容量：.reserve(n)下标[]: .operator[](i)不检查越界，.at(i)越界跑出异常*/#include <iostream>#include <vector>using namespace std;#include "print.h"#include <exception>#include <typeinfo>int main(){vector<double> vd, vv;//可以代替数组，能完成很多数组无法完成的功能for(int i=0;i<9;i++){vd.push_back(i+0.1);cout<<&*vd.begin()<<':';cout<<vd.size()<<'/'<<vd.capacity()<<endl;}cout<<"--------1---------"<<endl;vv.reserve(9);for(int i=0;i<9;i++){vv.push_back(i+0.1);cout<<vv.size()<<'/'<<vv.capacity()<<endl;}vd[3]=123.45;vv.at(5)=67.8;cout<<"--------2---------"<<endl;for(int i=0;i<=vd.size();i++)cout<<vd[i]<<' ';cout<< endl;cout<<"--------3---------"<<endl;try{for(int i=0;i<=vv.size();i++)cout<<vv.at(i)<<' ';cout<< endl;}catch(exception& e){cout<<"异常:"<<e.what()<<endl;cout<<"类型:"<<typeid(e).name()<<endl;int m=3,n=5;vector< vector<int> > vvi(m,vector<int>(n));//等同于二维数组//vector< vector<int> > vvi; 效果相同vvi.resize(m+3);//指定大小为（m＋3）行vvi[1].assign(9,1);//给第二行元素赋值9个1vvi[5].assign(4,5);void print(const vector< vector<int> >& v);print(vvi);}void print(const vector< vector<int> >& v){for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++){cout<<v[i][j]<<' ';}cout<<endl;}}template <typename T>void show(T a[],int n);template <typename T>void show(const vector<int>& v);/*0x804e008:1/10x804e018:2/20x804e030:3/40x804e030:4/40x804e058:5/80x804e058:6/80x804e058:7/80x804e058:8/80x804e0a0:9/16--------1---------1/92/93/94/95/96/97/99/9--------2---------0.1 1.1 2.1 123.45 4.1 5.1 6.1 7.1 8.1 0--------3---------0.1 1.1 2.1 3.1 4.1 67.8 6.1 7.1 8.1 异常:vector::_M_range_check 类型:St12out_of_range0 0 0 0 01 1 1 1 1 1 1 1 10 0 0 0 05 5 5 5*/-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-/*deque的个性：double-ended queue 双端队列下标[]: .operator[](i)不检查越界，.at(i)越界抛异常增删：.push_front(element), .pop_front() 可以从前后增删数据*/#include <iostream>using namespace std;#include <deque>#include "print.h"int main(){deque<char> dc;dc.push_back(97);dc.push_back('c');dc.push_front('s');dc.push_front('d');dc.push_back('k');dc.push_back('$');print(dc.begin(),dc.end());dc[1]='t';for(int i=0;i<dc.size();i++)cout<<dc[i]<<',';cout<<endl;dc.pop_back();dc.pop_front();print(dc.begin(),dc.end());}-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-/*list的个性：双向链表增删：.push_front(element), .pop_front(),.remove(element)//需要==运算符，表示删除等于“element”的所有元素不支持下标[]除重：.unique()相邻的重复元素只保留一个排序：.sort(compare_func=less)默认用小于符号比较，从小到大排序倒置：.reverse()颠倒链表中的元素转移：.splice(pos,list2)把list2链表中的所有元素转移到指定位置.splice(pos,list2,pos2),.splice(pos,list2,pos_beg,pos_end)归并：.merge(list2)*/#include <iostream>using namespace std;#include <list>#include "print.h"#include <cassert>bool compare(int x,int y)//自定排序规则{x%=3,y%=3;return x<y;}int main(){int a[]={3,8,8,8,5,5,1,8,8,7};int b[6]={9,3,5,2,7,6};list<int> li(a,a+10), lili(b,b+6);print(li.begin(),li.end());li.unique();print(li.begin(),li.end());li.sort();print(li.begin(),li.end());li.unique();print(li.begin(),li.end());li.reverse();print(li.begin(),li.end());li.splice(li.begin(),lili);print(li.begin(),li.end());assert(lili.empty());//判断是否为空li.remove(5); //删除所有的5print(li.begin(),li.end());li.sort();li.unique();print(li.begin(),li.end());lili.push_back(0);lili.push_back(4);lili.push_back(5);lili.push_back(7);lili.push_back(10);lili.sort();print(lili.begin(),lili.end());li.merge(lili);//将两个排好序的链表归并print(li.begin(),li.end());lili.assign(b,b+6);print(lili.begin(),lili.end());lili.sort(greater<int>());//从大到小排序print(lili.begin(),lili.end());lili.sort(compare);print(lili.begin(),lili.end());}。