- 构造
- 赋值和交换
- 大小
- 插入和删除
- 数据的获取,不能用at和[]了,不是随机存取
- 反转reserve,排序sort的两种用法和从大到小的写法
#include<iostream>
#include<list>
using namespace std;
void printlist(const list<int>& l)
{
for (list<int>::const_iterator it = l.begin(); it != l.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
list<int> l;
l.push_back(10);
l.push_back(20);
l.push_back(30);
l.push_back(40);
printlist(l);
list<int>l2(l.begin(), l.end());
printlist(l2);
list<int>l3(l2);
printlist(l3);
list<int>l4(10, 1000);
printlist(l4);
}
void test02()
{
list<int> l1;
l1.push_back(10);
l1.push_back(20);
l1.push_back(30);
l1.push_back(40);
printlist(l1);
list<int>l2;
l2 = l1;
printlist(l2);
list<int>l3;
l3.assign(l2.begin(), l2.end());
printlist(l3);
list<int>l4;
l4.assign(10, 100);
printlist(l4);
cout << "交换前: " << endl;
printlist(l1);
printlist(l4);
cout << endl;
l1.swap(l4);
cout << "交换后: " << endl;
printlist(l1);
printlist(l4);
}
void test03()
{
list<int> l1;
l1.push_back(10);
l1.push_back(20);
l1.push_back(30);
l1.push_back(40);
printlist(l1);
if (l1.empty())
{
cout << "l1为空" << endl;
}
else
{
cout << "l1不为空" << endl;
cout << "l1的大小为" <<l1.size()<< endl;
}
l1.resize(10);
printlist(l1);
l1.resize(2);
printlist(l1);
}
void test04()
{
list<int> l;
l.push_back(10);
l.push_back(20);
l.push_back(30);
l.push_back(40);
l.push_front(100);
l.push_front(2100);
l.push_front(100);
printlist(l);
l.pop_back();
printlist(l);
l.pop_front();
printlist(l);
cout << "插入" << endl;
list<int>::iterator it = l.begin()++;
l.insert(it++, 1000);
printlist(l);
l.erase(++it);
printlist(l);
l.push_back(1000);
l.push_back(1000);
l.push_back(1000);
printlist(l);
l.remove(1000);
printlist(l);
l.clear();
printlist(l);
}
void test05()
{
list<int> l;
l.push_back(10);
l.push_back(20);
l.push_back(30);
l.push_back(40);
printlist(l);
cout << "第一个元素" << l.front() << endl;
cout << "最后一个元素" << l.back() << endl;
}
bool mycompare(int val1, int val2)
{
return val1 > val2;
}
void test06()
{
list<int> l;
l.push_back(10);
l.push_back(20);
l.push_back(30);
l.push_back(40);
printlist(l);
l.reverse();
printlist(l);
l.sort();
printlist(l);
l.sort(mycompare);
printlist(l);
}
int main()
{
test01();
test02();
test03();
test04();
test05();
test06();
return 0;
}