List容器
1.双向链表容器
2.不能随机存放元素,不支持at.(pos)函数与[ ]操作符,可以it++,但不能it+n
#include<iostream>
using namespace std;
#include<list>
void main()
{
list<int> l;
cout << l.size() << endl;
for (int i = 0; i < 10;i++)
{
l.push_back(i);//尾部插入元素
}
cout << l.size() << endl;
list<int>::iterator it = l.begin();
while (it != l.end())
{
cout << *it << " ";
it++;
}
//list不能随机访问
it = l.begin();
it++;
it++;
it++;
//0 1 2 3 4
l.insert(it,100);//100插入到了什么地方
//it = it + 1;
//it = it + 5;
cout << endl;
for (list<int>::iterator it2 = l.begin(); it2 != l.end(); it2++)
{
cout << *it2 << " ";
}
//结论1 链表的结点的index是从0号开始的
// 在3号位置插入元素就是让100成为3号位置,其他的后移
}
void main72()//list删除
{
list<int> l;
cout << l.size() << endl;
for (int i = 0; i < 10; i++)
{
l.push_back(i);//尾部插入元素
}
cout << l.size() << endl;
list<int>::iterator it3;
for ( it3 = l.begin(); it3 != l.end(); it3++)
{
cout << *it3 << " ";
}
list<int>::iterator it = l.begin();
list<int>::iterator it2 = l.begin();
it2++;
it2++;
it2++;
l.erase(it, it2);//删除区间,左闭右开[it,it2),it2没有被删除
//l.erase(pos);//删除POS位置数据,返回下一数据位置
cout << endl;
for ( it3 = l.begin(); it3 != l.end(); it3++)
{
cout << *it3 << " ";
}
l.insert(l.begin(), 100);
l.insert(l.begin(), 100);
l.insert(l.begin(), 100);
cout << endl;
for (it3 = l.begin(); it3 != l.end(); it3++)
{
cout << *it3 << " ";
}
l.remove(100);//删除容器中所有100值匹配的元素
cout << endl;
for (it3 = l.begin(); it3 != l.end(); it3++)
{
cout << *it3 << " ";
}
}