链表特性:
1.l.reverse() //逆序
2.链表不支持迭代器的随机访问
it++;可以
it+1;不行
3.可以直接删除值,删掉所有特定值的元素
l.remove(2);
#include <iostream>
#include <algorithm>
#include <string>
#include <deque>
#include <list>
using namespace std;
void printd(deque<int> &d)
{
deque<int>::iterator it=d.begin();
while(it!=d.end())
{
cout<<*it<<" ";
++it;
}
cout<<endl;
}
void func6()
{
deque<int> d;
d.push_back(1);
d.push_back(2);
d.push_back(3);
d.push_front(-1);
d.push_front(-2);
d.push_front(-3);
cout<<"个数"<<d.size()<<endl;
printd(d);
d.pop_back();
d.pop_front();
printd(d);
}
void printl(list<int> &l)
{
list<int>::iterator it = l.begin();
while(it!=l.end())
{
cout<<*it<<" ";
++it;
}
cout<&
C++ deque,list
最新推荐文章于 2023-04-13 18:27:13 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)