顺序容器vector、deque和List练习

（1）顺序容器vector练习

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>    //调用sort函数
using namespace std;
int main()
{ 
//顺序容器练习 整形
vector<int> arr;
for(int i=6;i>0;i--)
   arr.push_back(i);
for(int j=0;j<arr.size();j++)
   cout<<"the "<<j<<": "<<arr[j]<<endl;

//排序

vector<int>::iterator item;
sort(arr.begin(),arr.end());
for(item=arr.begin();item!=arr.end();item++)
   cout<<*item<<endl;
    
//查找
vector<int>::iterator p1,last=arr.end();
int num=4;
if((p1=find(arr.begin(),arr.end(),num))!=last)    {cout<<"find :"<<*p1<<endl;cout<<endl;}
     else {
          cout<<"the element is not found!\n"<<endl;
          cout<<endl;
          
          }

//顺序容器练习 字符串
vector<string> con;
string text_word;
cin>>text_word;
while(text_word!="aaa")
{
   con.push_back(text_word);
   cin>>text_word;
}
for(int k=0;k<con.size();k++)
   cout<<"the "<<k<<": "<<con[k]<<endl;

return 0;

}

（2）顺序容器deque练习

#include <iostream>
#include <vector>
#include <deque>
using namespace std;
void PrintIt(deque<int> n)
{
for(deque<int>::iterator iter=n.begin(); iter!=n.end(); ++iter)
cout<<*iter<<" ";//用迭代器进行输出循环 
}
int main()
{
int arr[5]={1,2,3,4,5};
vector<int> v(&arr[0],&arr[4]+1);
    deque<int> a; //好像不支持deque<int> a(v.begin(),v.end());

    a.push_back(0);
a.push_back(1);
a.push_back(3);
    PrintIt(a);
cout<<endl;
cout<<"the second num:"<<a.at(1)<<endl;
    a.pop_back();
cout<<"delete the last:";
PrintIt(a);
cout<<endl;
return 0;

}

（3）顺序容器List练习

#include <iostream>
#include <list>
using namespace std;
void PrintIt(list<int> n)
{
for(list<int>::iterator iter=n.begin(); iter!=n.end(); ++iter)
cout<<*iter<<" ";//用迭代器进行输出循环 
}

int main()
{
list<int> testlist1,testlist2;
testlist1.push_back(4);
testlist1.push_back(8);
testlist1.push_back(16);
testlist1.push_back(7);
testlist1.push_back(100);
cout<<"排序前：";
PrintIt(testlist1);
cout<<endl;

//给testlist1排序
testlist1.sort();
cout<<"排序后：";
PrintIt(testlist1);
cout<<endl;

//合并两个排序列表后
testlist2.push_back(54);
testlist2.push_back(58);
testlist2.push_back(100);
testlist1.merge(testlist2);

cout<<"合并后：";
PrintIt(testlist1);
cout<<endl;
//合并两个排序列表后
testlist1.unique();
cout<<"删除重复后：";
PrintIt(testlist1);
cout<<endl;
return 0;

}