- deque容器的基本概念
功能：双端数组，可以对头端进行删除和插入
deque和vector的区别
·vector对于头部的插入删除效率低，数据量越大，效率越低
·deque相对而言，对头部的插入和删除比较块
·vector访问元素的速度比deque快，这与两者内部实现有关。
·deque的迭代器也是支持随机访问的
构造函数：
#include <iostream>
#include <deque>using namespace std;/*void printDeque(deque<int> &d)
{for(deque<int>::iterator it = d.begin(); it != d.end(); it++){cout << *it << " ";}cout << endl;
}*///防止容器内数据被修改，设置为只读
void printDeque(const deque<int> &d)
{for(deque<int>::const_iterator it = d.begin(); it != d.end(); it++){//*it = 100;//不能被修改了cout << *it << " ";}cout << endl;
}void test01()
{deque<int> d1;for(int i = 0; i < 10; i++ ){d1.push_back(i);}printDeque(d1);deque<int> d2(d1.begin(),d1.end());//区间构造printDeque(d2);deque<int> d3(10,100);//10个100printDeque(d3);deque<int>d4(d3);//拷贝构造printDeque(d4);
}int main(void)
{test01();return 0;
}deque赋值：
#include <iostream>
#include <deque>using namespace std;void printDeque(const deque<int> &d)
{for(deque<int>::const_iterator it = d.begin(); it != d.end(); it++){cout << *it << " ";}cout << endl;
}void test01()
{deque<int> d1;for(int i = 0; i < 10; i++){d1.push_back(i);}printDeque(d1);//operator=赋值deque<int> d2 = d1;printDeque(d2);//assign赋值deque<int> d3;d3.assign(d1.begin(), d1.end());printDeque(d3);deque<int> d4;d4.assign(10,100);//10个100printDeque(d4);
}int main(void)
{test01();return 0;
}deque容器大小操作
#include <iostream>
#include <deque>using namespace std;void printDeque(const deque<int> &d)
{for(deque<int>::const_iterator it = d.begin(); it != d.end(); it++){cout << *it << " ";}cout << endl;
}void test01()
{deque<int> d1;for(int i = 0; i< 10; i++){d1.push_back(i);}printDeque(d1);if(d1.empty()){cout << "d1为空" << endl;}else{cout << "d1不为空" << endl;cout << "d1的大小为" << d1.size() << endl;//deque容器没有capcity这个接口，因为它可以无限扩充容量}//重新指定大小d1.resize(15);//默认用0补充printDeque(d1);d1.resize(15,1);//设置用1来补充printDeque(d1);
}int main(int argc, char const *argv[])
{test01();return 0;
}deque容器的删除
#include <iostream>
#include <deque>using namespace std;void printDeque(const deque<int> &d)
{for(deque<int>::const_iterator it = d.begin(); it != d.end(); it++){cout << *it << " ";}cout << endl;
}void test01()
{deque<int> d1;//尾插d1.push_back(10);d1.push_back(20);//头插d1.push_front(100);d1.push_front(200);printDeque(d1);//尾删d1.pop_back();//头删d1.pop_front();printDeque(d1);//insert插入d1.insert(d1.begin(),300);//第一个参数必须是一个迭代器d1.insert(d1.end(),2,400);//在末尾插入两个400printDeque(d1);deque<int> d2;d2.insert(d2.begin(),d1.begin(),d1.end());//按照区间来插入在d2的头插入d1这个区间的元素printDeque(d2);//删除deque<int>:: iterator it = d1.begin();it++;d1.erase(it);//删除第二个元素的方法，以此类推printDeque(d1);d1.erase(it,++it);//删除区间printDeque(d1);//清空d1.clear();printDeque(d1);
}int main(int argc, char const *argv[])
{test01();return 0;
}deque容器数据存取
#include <iostream>
#include <deque>using namespace std;void test01()
{deque<int> d1;d1.push_front(30);d1.push_front(20);d1.push_front(10);d1.push_back(40);d1.push_back(50);d1.push_back(60);//[]方式访问for(int i = 0; i< d1.size(); i++){cout << d1[i] << " ";}cout << endl;//at方式访问for(int i = 0; i< d1.size(); i++){cout << d1.at(i) << " ";}cout << endl;cout << "第一个元素为：" << d1.front() << endl;cout << "最后一个元素为：" << d1.back() << endl;
}int main(int argc, char const *argv[])
{test01();return 0;
}deque容器排序
#include <iostream>
#include <deque>
#include <algorithm>//标准算法头文件using namespace std;void printDeque(const deque<int> &d)
{for(deque<int>::const_iterator it = d.begin(); it != d.end(); it++){cout << *it << " ";}cout << endl;
}void test01()
{deque<int> d1;d1.push_back(10);d1.push_back(20);d1.push_back(30);d1.push_front(100);d1.push_front(200);d1.push_front(300);cout << "排序前" << endl;printDeque(d1);//排序(默认重小到大)//只要支持随即访问的迭代器的容器，都可以利用sort算法进行排序sort(d1.begin(),d1.end());cout << "排序后" << endl;printDeque(d1);}int main()
{test01();return 0;
}案例：有5名选手，选手ABCDE，10个评委分别给每一位选手打分，去除最高分和最低分，取平均分。
步骤：
·创建5名选手，放到vector中
·遍历vector容器，取出来每一个选手，执行for循环，可以把10个评分存到deque容器中
·sort算法对deque容器中分数进行排序，去除最低分和最高分
·deque容器遍历一遍，累加总分
·获取平均分并打印
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <ctime>using namespace std;class Person
{
public:Person(string name, int score){this->m_name = name;this->m_score = score;}
public:string m_name;//姓名int m_score;//平均分
};//创建5名选手
void creatPlayer(vector<Person> &v1)
{string nameSeed = "ABCDE";for(int i = 0; i < 5; i++){string name = "选手";name += nameSeed[i];int score = 0;//默认分数为0Person p(name,score);//将创建的选手对象放入到容器v1.push_back(p);}
}void setScore(vector<Person> &v2)
{for(vector<Person>::iterator it = v2.begin(); it != v2.end(); it++){//将评位的分数放到deque容器中deque<int> d;for(int i = 0; i < 10; i++){int score = rand() % 41 + 60;//60-100的随机数d.push_back(score);}/*cout << "选手" << it->m_name << "得分" << endl;for(deque<int>::iterator dit = d.begin(); dit != d.end(); dit++){cout << *dit << " ";}cout << endl;*///排序sort(d.begin(), d.end());//去除最高分和最低分d.pop_back();d.pop_front();//取平均分int sum = 0;for(deque<int>::iterator dit = d.begin(); dit != d.end(); dit++){sum += *dit;}int avg = sum/d.size();//将平均分赋给选手it->m_score = avg;}
}void showScore(vector<Person> &v)
{for(vector<Person>::iterator it = v.begin(); it != v.end(); it++){cout << "姓名：" << it->m_name << "平均分：" << it->m_score << endl;}
}int main(void)
{//设置随机数种子srand((unsigned int)time(NULL));//创建5名选手vector<Person> v;//存放选手容器creatPlayer(v);//测试/*for(vector<Person>::iterator it = v.begin(); it != v.end(); it++){cout << "姓名：" << (*it).m_name << "分数：" << (*it).m_score << endl;}*///给5名选手打分setScore(v);//显示最后得分showScore(v);return 0;
}
