目录
3.3 deque容器
3.3.1 deque容器基本概念
功能:
双端数组,可以对头端进行插入删除操作
deque与vector的区别:
vector对于头部的插入删除效率低,数据量较大,效率较低
deque相对而言对头部的插入删除速度比vector快
vector访问元素时的速度会比deque快,这和两者内部实现有关
deque内部工作原理:
deque内部有个中控器,维护每段缓冲区中的内容,缓冲区中存放真实数据
中控器维护的是每个缓冲区的地址,使得使用deque时像一片连续的内存空间
3.3.2 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);
deque<int>d2(d1.begin(),d1.end());
printDeque(d2);
deque<int>d3(10,100);
printDeque(d3);
deque<int>d4(d3);
printDeque(d4);
}
int main()
{
test01();
system("pause");
return 0;
}
3.3.3 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);
}
//operator= 赋值
deque<int>d2;
d2 = d1;
printDeque(d2);
//assign 赋值
deque<int>d3;
d3.assign(d1.begin(), d1.end());
deque<int>d4;
d4.assign(10,100);
printDeque(d4);
}
int main()
{
test01();
system("pause");
return 0;
}
3.3.4 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's Size:" << d1.size() << endl;
}
//d1.resize(15);
d1.resize(15,1);
printDeque(d1);
d1.resize(5);
printDeque(d1);
}
int main()
{
test01();
system("pause");
return 0;
}
3.3.5 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);
//200 100 10 20
printDeque(d1);
//尾删
d1.pop_back();
//头删
d1.pop_front();
//100 10
printDeque(d1);
}
void test02()
{
deque<int>d1;
d1.push_back(10);
d1.push_back(20);
d1.push_front(100);
d1.push_front(200);
//200 100 10 20
d1.insert(d1.begin(),1000);
printDeque(d1);
//1000 200 100 10 20
d1.insert(d1.begin(),2,10000);
printDeque(d1);
//10000 10000 1000 200 100 10 20
deque<int>d2;
d2.push_back(1);
d2.push_back(2);
d2.push_back(3);
d1.insert(d1.begin(),d2.begin(),d2.end());
//1 2 3 10000 10000 1000 200 100 10 20
//在指定位置插入区间
printDeque(d1);
}
void test03()
{
deque<int>d1;
d1.push_back(10);
d1.push_back(20);
d1.push_front(100);
d1.push_front(200);
deque<int>::iterator it = d1.begin();
it++;
d1.erase(it);
//往后偏移并删除
printDeque(d1);
//按区间方式删除
d1.erase(d1.begin(), d1.end());
//清空容器
d1.clear();
printDeque(d1);
}
int main()
{
test03();
system("pause");
return 0;
}
3.3.6 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);
//两种访问方式
for(int i = 0; i < d1.size(); i++)
{
cout << d1[i] << " ";
}
cout << endl;
for(int i = 0; i < d1.size(); i++)
{
cout << d1.at(i) << " ";
}
cout << endl;
//输出头尾元素
cout << d1.front() << " " << d1.back() << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
3.3.7 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_front(100);
d1.push_front(200);
printDeque(d1);
sort(d1.begin(),d1.end());
printDeque(d1);
}
int main()
{
test01();
system("pause");
return 0;
}
1.使用sort()时需要包含algorithm头文件
2.所有支持随机访问迭代器的容器,都可以用sort来排序,例如vector