目录
1.deque容器的构造函数
代码示例：
2.deque的赋值操作
3.deque的大小操作
4.deque的插入和删除
5.deque的数据存取
6.deque的排序操作
1.deque容器的构造函数
代码示例：
#include<bits/stdc++.h>
using namespace std;void print(deque<int> &d)
{for(deque<int>::iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}
int main()
{deque<int> d;d.push_back(3); d.push_back(5); d.push_back(36); d.push_back(7); d.push_back(58);print(d); //区间方式赋值deque<int> d2(d.begin(),d.end());print(d2);deque<int> d3(3,99);print(d3);deque<int> d4(d2);print(d4);return 0;
}
2.deque的赋值操作
#include<bits/stdc++.h>
using namespace std;void print(const deque<int> &d)
{for(deque<int>::const_iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}int main()
{deque<int> d1;d1.push_back(3); d1.push_back(5); d1.push_back(36); d1.push_back(7); d1.push_back(58);print(d1);deque<int> d2;d2 = d1;print(d2);deque<int> d3;d3.assign(d2.begin(),d2.end());print(d3);deque<int> d4;d4.assign(3,99);print(d4);return 0;
}
3.deque的大小操作
#include<bits/stdc++.h>
using namespace std;void print(const deque<int> &d)
{for(deque<int>::const_iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}int main()
{deque<int> d1;d1.push_back(3); d1.push_back(5); d1.push_back(36); d1.push_back(7); d1.push_back(58);print(d1);cout << d1.empty() << endl;cout << d1.size() << endl;d1.resize(7,99);cout << d1.size() << endl;print(d1);return 0;
}
4.deque的插入和删除
#include<bits/stdc++.h>
using namespace std;void print(const deque<int> &d)
{for(deque<int>::const_iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}int main()
{deque<int> d1;d1.push_back(3); d1.push_back(5); d1.push_back(36); d1.push_front(2);d1.push_front(9);print(d1);d1.pop_back();print(d1);d1.pop_front();print(d1);d1.insert(d1.begin(),2,100);print(d1);d1.erase(d1.begin()+2);print(d1);d1.clear();print(d1);cout << "end";return 0;
}
5.deque的数据存取
#include<bits/stdc++.h>
using namespace std;void print(const deque<int> &d)
{for(deque<int>::const_iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}int main()
{deque<int> d1;d1.push_back(3); d1.push_back(5); d1.push_back(36); d1.push_front(2);d1.push_front(9);print(d1);for(int i = 0; i < d1.size(); i++){cout << d1[i] << ' ';}cout << endl;for(int i = 0; i < d1.size(); i++){cout << d1.at(i) << ' ';}cout << endl;cout << d1.front() << endl;cout << d1.back() << endl;return 0;
} 
6.deque的排序操作
#include<bits/stdc++.h>
using namespace std;void print(const deque<int> &d)
{for(deque<int>::const_iterator i = d.begin(); i != d.end(); i++)cout << *i << ' ';cout << endl;
}int main()
{deque<int> d1;d1.push_back(3); d1.push_back(5); d1.push_back(36); d1.push_front(2);d1.push_front(9);print(d1);sort(d1.begin(),d1.end());cout << "排序后:" << endl;//默认从小到大排序print(d1);return 0;
} 
