deque容器
1.构造函数
代码工程
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
using namespace std;
void printDeque(const deque<int>&d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
deque<int>d;
for (int i = 0; i < 5; i++)
{
d.push_back(i);
}
printDeque(d);
deque<int>d1(d.begin(), d.end());
printDeque(d1);
deque<int>d2(5, 100);
printDeque(d2);
deque<int>d3(d2);
printDeque(d3);
return;
}
int main()
{
test01();
return 0;
}
运行结果
2.赋值
代码工程
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
using namespace std;
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
deque<int>d;
for (int i = 0; i < 5; i++)
{
d.push_back(i + 1);
}
printDeque(d);
deque<int>d1;
d1 = d;
printDeque(d1);
deque<int>d2;
d2.assign(d1.begin(), d1.end());
printDeque(d2);
deque<int>d3;
d3.assign(5, 200);
printDeque(d3);
return;
}
int main()
{
test01();
return 0;
}
运行结果
3.大小操作
代码工程
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
using namespace std;
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
deque<int>d;
for (int i = 0; i < 5; i++)
{
d.push_back(i + 1);
}
printDeque(d);
if (0 != d.empty())
{
cout << "容器为空" << endl;
}
else
{
cout << "容器中的元素个数:" << d.size() << endl;
d.resize(10, 50);
printDeque(d);
d.resize(2);
printDeque(d);
}
return;
}
int main()
{
test01();
return 0;
}
运行结果
4.插入和删除
代码工程
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
using namespace std;
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
deque<int>d;
d.push_back(10);
d.push_back(20);
d.push_back(30);
cout << "尾插: ";
printDeque(d);
d.pop_back();
cout << "尾删: ";
printDeque(d);
d.push_front(100);
d.push_front(200);
cout << "头插: ";
printDeque(d);
d.pop_front();
cout << "头删: ";
printDeque(d);
d.insert(d.begin(), 500);
cout << "头部插入: ";
printDeque(d);
d.insert(d.begin(), 2, 1000);
cout << "头部插入2个元素: ";
printDeque(d);
deque<int>d1;
d1.push_back(1);
d1.push_back(2);
d1.push_back(3);
cout << "头部插入区间元素: ";
d.insert(d.begin(), d1.begin(), d1.end());
printDeque(d);
cout << endl;
return;
}
void test02()
{
deque<int>d;
d.push_back(10);
d.push_back(20);
d.push_front(100);
d.push_front(200);
d.push_front(300);
cout << "容器中的元素:";
printDeque(d);
deque<int>::iterator it = d.begin();
cout << "删除第二个元素:";
it++;
d.erase(it);
printDeque(d);
cout << "删除区间元素:";
it = d.begin();
it++;
d.erase(it, d.end());
printDeque(d);
d.clear();
printDeque(d);
if (0 != d.empty())
{
cout << "容器为空!" << endl;
}
return;
}
int main()
{
test01();
cout << "以下测试删除函数" << endl;
test02();
return 0;
}
运行结果
5.数据存取
工程代码
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
using namespace std;
void test01()
{
deque<int>d;
d.push_back(10);
d.push_back(20);
d.push_back(30);
d.push_back(40);
for (int i = 0; i < d.size(); i++)
{
cout << d[i] << " ";
}
cout << endl;
for (int i = 0; i < d.size(); i++)
{
cout << d.at(i) << " ";
}
cout << endl;
cout << "容器的第一个元素为: " << d.front() << endl;
cout << "容器的最后一个元素为: " << d.back() << endl;
return;
}
int main()
{
test01();
return 0;
}
运行结果
6.排序操作
函数: sort()
1.默认是升序排列
2.添加仿函数可以降序排列
代码工程
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<deque>
#include<algorithm>
using namespace std;
void printDeque(const deque<int> &d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
class MyCompare
{
public:
bool operator()(int v1, int v2)
{
return v1 > v2;
}
};
void test01()
{
deque<int>d;
d.push_back(10);
d.push_back(30);
d.push_back(60);
d.push_back(50);
printDeque(d);
cout << "排序过后" << endl;
sort(d.begin(), d.end());
printDeque(d);
cout << "降序排列" << endl;
sort(d.begin(), d.end(), MyCompare());
printDeque(d);
return;
}
int main()
{
test01();
return 0;
}
运行结果