c++中的双端队列deque

// 第四次练习4.25start.cpp : 定义控制台应用程序的入口点。
#include<iostream>
#include<deque>
#include<algorithm>
using namespace std;
void printDeque(deque<int> &d)
{
	for (deque<int>::iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void play03()
{
	deque<int> d1;
	d1.push_back(7);
	d1.push_back(2);
	d1.push_back(8);

	d1.push_front(8);
	d1.push_front(2);
	d1.push_front(3);
	cout << endl;
	cout << "头部元素：" << d1.front() << endl;
	cout << "尾部元素：" << d1.back() << endl;
	printDeque(d1);

	d1.pop_front();
	d1.pop_back();
	printDeque(d1);
	//查找8在数组下标的值
	deque<int>::iterator it = find(d1.begin(), d1.end(), 8);
	if (it != d1.end())
	{
		cout << "8在数组下标的值:" << distance(d1.begin(), it) << endl;
	}
	else
	{
		cout << "没有找到值为8的元素" << endl;
	}
}
int main()
{
	play03();
	system("pause");
	return 0;
}