C++ deque用例
deque<int> ideq
增加函数 ideq.push_front( x):双端队列头部增加一个元素X
ideq.push_back(x):双端队列尾部增加一个元素x
删除函数ideq.pop_front():删除双端队列中最前一个元素
ideq.pop_back():删除双端队列中最后一个元素
ideq.clear():清空双端队列中元素
判断函数ideq.empty() :向量是否为空，若true,则向量中无元素
大小函数ideq.size():返回向量中元素的个数。
#include <deque>
#include <iostream>
int main()
{
std::deque<int> a(10);
for (int i = 0; i < 10; i++)
{
a[i] = i;
}
std::cout << "The element of deque is ";
for (int i = 0; i < a.size(); i++)
{
std::cout << a.at(i) << " ";
}
std::cout << std::endl;
a.push_front(100);
std::cout << "Push 100 in the front. The element of deque is ";
for (int i = 0; i < a.size(); i++)
{
std::cout << a.at(i) << " ";
}
std::cout << std::endl;
a.push_back(99);
std::cout << "Push 99 in the back. The element of deque is ";
for (int i = 0; i < a.size(); i++)
{
std::cout << a.at(i) << " ";
}
std::cout << std::endl;
a.pop_back();
std::cout << "Pop back. The element of deque is ";
for (int i = 0; i < a.size(); i++)
{
std::cout << a.at(i) << " ";
}
std::cout << std::endl;
a.pop_front();
std::cout << "Pop front. The element of deque is ";
for (int i = 0; i < a.size(); i++)
{
std::cout << a.at(i) << " ";
}
std::cout << std::endl;
system("pause");
return 0;
}
