deque容器（学习）

deque容器基本概念

双端数组，可以对头端进行插入和删除操作

与vector差别：

• vector对于头部的插入删除效率低，数据量越大，效率越低
• deque相对而言，对头部的插入删除速度比vector快
• vector访问元素会比deque快
• 

 

deque容器构造函数

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

void PrintDeque(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 < 5;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;

}

 

deque容器赋值操作

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

void PrintDeque(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 < 5;i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);

	deque<int>d2;
	d2 = d1;
	PrintDeque(d2);

	deque<int>d3;
	d3.assign(d1.begin(), d1.end());

	deque<int>d4;
	d4.assign(10, 100);

}

int main()
{
	test01();
	system("pause");
	return 0;

}

 

deque容器大小操作

 

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

void PrintDeque(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 < 5;i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);
	if (d1.empty())
	{
		cout << "d1为空" << endl;
	}
	else
	{
		cout << "d1不为空" << endl;
		cout << "Size" << d1.size() << endl;
	}

	d1.resize(15);
	PrintDeque(d1);

	d1.resize(20, 1);
	PrintDeque(d1);

}

int main()
{
	test01();
	system("pause");
	return 0;

}

deque容器插入和删除

 

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

void PrintDeque(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(300);
	d1.push_front(500);
	PrintDeque(d1);
	d1.pop_front();
	d1.pop_back();
	PrintDeque(d1);
}

void test02()
{
	deque<int>d2;
	d2.push_back(10);
	d2.push_back(20);
	d2.push_front(100);
	d2.push_front(200);

	PrintDeque(d2);
	
	d2.insert(d2.begin(), 1000);
	PrintDeque(d2);
	
	d2.insert(d2.begin(), 2, 10000);
	PrintDeque(d2);


	deque<int>d3;
	d3.push_back(0);
	d3.push_back(21110);
	d3.push_front(100);
	d3.push_front(206510);

	d3.insert(d3.begin(), d2.begin(), d2.end());
	PrintDeque(d3);
}


void test03()
{
	deque<int>d1;
	d1.push_back(10);
	d1.push_back(20);
	d1.push_back(30);

	deque<int>::iterator it = d1.begin();
	it++;
	d1.erase(it);
	PrintDeque(d1);
}
int main()
{
	test01();
	test02();
	test03();
	system("pause");
	return 0;
}

deque容器数据存取

 

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

void PrintDeque(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 < 5;i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);
	for (int i = 0;i < d1.size();i++)
	{
		cout << d1[i] << " ";
		cout << d1.at(i) << " ";
	}
	cout << endl;
	cout << d1.front() << " " << d1.back() << endl;
}


int main()
{
	test01();
	system("pause");
	return 0;

}

deque容器排序

 

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

void PrintDeque(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(300);
	d1.push_front(500);
	PrintDeque(d1);
	
	sort(d1.begin(), d1.end());
	PrintDeque(d1);
}


int main()
{
	test01();
	system("pause");
	return 0;

}