01 deque容器_构造函数
02 deque容器_赋值操作
03 deque容器_大小操作
04 deque容器_插入和删除
05 deque容器_数据存取
06 deque容器_排序
01 deque容器_构造函数
#include<iostream>
using namespace std;
#include<deque>
//防止修改用const,只读状态const,for循环也要修改deque<int>::const_iterator
void printDeque(const deque<int> &d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
//*it = 100;
cout << *it << " ";
}
cout << endl;
}
void test()
{
deque<int>d1;
for (int i = 0; i < 10; i++)
{
d1.push_back(i);
}
printDeque(d1);
deque<int>d2(d1.begin(), d1.end());
printDeque(d2);
deque<int>d3(10, 1000);
printDeque(d3);
deque<int>d4(d3);
printDeque(d4);
}
int main()
{
test();
system("pause");
return 0;
}
//总结:deque容器和vector容器的构造方式几乎一致,灵活使用即可
02 deque容器_赋值操作
#include<iostream>
using namespace std;
#include<deque>
//防止修改用const,只读状态const,for循环也要修改deque<int>::const_iterator
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
{
//*it = 100;
cout << *it << " ";
}
cout << endl;
}
void test()
{
deque<int>d1;
for (int i = 0; i < 10; i++)
{
d1.push_back(i);
}
printDeque(d1);
deque<int>d2;
d2 = d1;
printDeque(d2);
deque<int>d3;
d3.assign(d1.begin(), d1.end());
printDeque(d3);
deque<int>d4;
d4.assign(10, 200);
printDeque(d4);
}
int main()
{
test();
system("pause");
return 0;
}
//总结:deque容器和vector容器赋值操作也相同,熟练掌握
03 deque容器_大小操作
#include<iostream>
using namespace std;
#include<deque>
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 <= 10; i++)
{
d.push_back(i);
}
printDeque(d);
if (d.empty())
{
cout << "d为空" << endl;
}
else
{
cout << "d不为空" << endl;
cout << "d的大小为" << d.size() << endl;
//deque没有容量概念
//重新指定大小
/*d.resize(15);
printDeque(d);*/
d.resize(15,1 ); //默认填充1
printDeque(d);
d.resize(5);
printDeque(d);
}
}
int main()
{
test01();
system("pause");
return 0;
}
//总结:
//deque没有容量概念
//判断是否为空 --empty
//返回元素个数--size
//重新指定个数 --resize
04 deque容器_插入和删除
#include<iostream>
using namespace std;
#include<deque>
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> d1;
//尾插
d1.push_back(10);
d1.push_back(20);
printDeque(d1);
//头插
d1.push_front(40);
d1.push_front(50);
printDeque(d1);
d1.insert(d1.begin(), 70);
printDeque(d1);
d1.insert(d1.begin(), 3, 53);
printDeque(d1);
//按照区间进行插入
deque<int> d2;
d2.push_back(20);
d2.push_back(60);
d2.push_back(90);
d2.push_back(190);
d1.insert(d1.begin(), d2.begin(), d2.end());
printDeque(d1);
}
//删除
void test02()
{
deque<int> d1;
d1.push_back(10);
d1.push_back(20);
d1.push_back(40);
d1.push_back(50);
deque<int>::iterator it = d1.begin();
it++;
d1.erase(it);
printDeque(d1);
//清空
//方法一:
/*d1.erase(d1.begin(), d1.end());
printDeque(d1);*/
//方法二:
d1.clear();
printDeque(d1);
}
int main()
{
//test01();
test02();
system("pause");
return 0;
}
//总结:
//插入和删除提供的位置是迭代器!
//尾插-- - push_back
//尾删-- - pop_back
//头插-- - push_front
//头删-- - pop_front
05 deque容器_数据存取
#include<iostream>
using namespace std;
#include<deque>
void test01()
{
deque<int> d;
d.push_back(10);
d.push_back(40);
d.push_back(56);
d.push_front(234);
d.push_front(344);
d.push_front(485);
//通过[]方式访问元素
for (int i = 0; i < d.size(); i++)
{
cout << d[i] << " ";
}
cout << endl;
//通过at方式访问元素
for (int i = 0; i < d.size(); i++)
{
cout << d.at(i) << " ";
}
cout << endl;
cout <<"第一个元素:"<< d.front() << endl;
cout << "最后一个元素:" << d.back() << endl;
}
int main()
{
test01();
system ("pause");
return 0;
}
//总结:
//·除了用迭代器获取deque容器中元素，[]和at也可以
//front返回容器第一个元素
//back返回容器最后一个元素
06 deque容器_排序
#include<iostream>
using namespace std;
#include<deque>
#include<algorithm> //标准算法头文件
void printDeque(const deque<int>& d)
{
for (deque<int>::const_iterator it=d.begin(); it!=d.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
//deque容器排序
void test01()
{
deque<int> d;
d.push_back(10);
d.push_back(40);
d.push_back(56);
d.push_front(234);
d.push_front(344);
d.push_front(485);
printDeque(d);
//排序默认从小到大升序
//对于支持随机访问的迭代器的容器，都可以利用sort算法直接对其进行排序
//vector容器也可以利用sort进行排序
sort(d.begin(), d.end());
printDeque(d);
}
int main()
{
test01();
system("pause");
return 0;
}
//总结: sort算法非常实用，使用时包含头文件algorithm即可
评论列表 (0 条评论)