deque是一个动态数组;与vector类似;deque可以在数组开头和末尾插入和删除元素,但是vector只能在末尾插入和删除元素。
#include <iostream>
#include<deque>
//
#include<algorithm>
using namespace std;
int main()
{
deque<int> a;
a.push_back(3);
a.push_back(4);
a.push_back(5);
a.push_front(2); // 前面插入
a.push_front(1);
a.push_front(0);
for (size_t nCount = 0; nCount < a.size(); nCount++)
{
cout << "a[" << nCount << "] = ";
cout << a[nCount] << endl;
}
cout << endl;
a.pop_back(); // 后面删除一个元素
a.pop_front(); // 前面删除一个元素
/*for (size_t nCount = 0; nCount < a.size(); nCount++)
{
cout << "a[" << nCount << "] = ";
cout << a[nCount] << endl;
}*/
deque<int>::iterator iElementLocater;
for (iElementLocater = a.begin(); iElementLocater != a.end(); iElementLocater++)
{
size_t nOffset = distance(a.begin(), iElementLocater);
cout << "a[" << nOffset << "] = " << *iElementLocater << endl;
}
//
system("pause");
return 0;
}
distance(a, b) // 表示两个指针之间的距离;