deque容器

deque容器基本概念

功能：双端数组，可以对头端进行插入删除操作
deque与vector区别：
vector对于头部的插入删除效率低，数据量越大，效率越低
deque相对而言，对头部的插入删除速度会比vvector快
vector访问元素的速度会比deque快，这和两者内部实现有关
push_front() 头部插入
pop_front() 头部删除
inert()	插入

#include<iostream>
using namespace std;
#include<deque>


void printDeque(const deque<int>&d) {
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++){
		//*it 容器数据不能修改
		cout << *it << " ";
	}
	cout << endl;
}

//deque构造函数

void test01() {

	deque<int>d1;
	for (int i = 0; i < 10; i++) {
		d1.push_back(i);
	}
	printDeque(d1);
}

int main() {
	test01();

	system("pause");
	return 0;
}

deque赋值操作

给deque容器进行赋值
#include<iostream>
using namespace std;
#include<deque>

void printDeque(const deque<int>&d) {
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++) {
		cout << *it << " ";

	}
	cout << endl;
}


//deque容器赋值操作
void test01() {
	deque<int>d1;
	for (int i = 0; i < 10; i++) {
		d1.push_back(i);
	}
	printDeque(d1);

	//operator = 赋值
	deque<int>d2;
	d2 = d1;
	printDeque(d2);
	//assign赋值
	deque<int>d3;
	d3.assign(d1.begin(), d1.end());
	printDeque(d3);
	//assign赋值
	deque<int>d4;
	d4.assign(10, 100);
	printDeque(d4);

}

int main() {

	test01();

	system("pause");
	return 0;
}

deque容器大小操作

#include<iostream>
using namespace std;
#include<deque>

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容器没有容量的概念
		//重新指定大小
		
	}
	//d1.resize(15);
	d1.resize(15, 1);
	printDeque(d1);

}

int main() {

	test01();

	system("pause");
	return 0;
}

deque 插入和删除

向deque中插入和删除数据
#include<iostream>
using namespace std;
#include<deque>

//deque容器插入和删除
//两端操作

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();
	printDeque(d1);
	//头删
	d1.pop_front();
	printDeque(d1);

}


int main() {

	test01();

	system("pause");
	return 0;
}

deque数据存取

at(int idx);	//返回索引idx所指的数据
operator[];

deque排序

sort(d.begin(), d.end());