C++ 超详细示例讲解list的使用

void test_list1()
{
	// 空构造
	list<int> l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	for (int e: l1)
	{
		cout << e << " ";
	}
	cout << endl;
	// 初始化的list中包含n个val值
	list<int> l2(4,10);
	for (int e : l2)
	{
		cout << e << " ";
	}
	cout << endl;
	// 拷贝构造函数
	list<int> l3(l1);
	for (int e : l3)
	{
		cout << e << " ";
	}
	cout << endl;
	// 用迭代器区间[first,last)构造list
	list<int> l4(l3.begin(), l3.end());
	for (int e : l4)
	{
		cout << e << " ";
	}
}

// 正\反向迭代器
void test_list2()
{
	list<int> lt;
	lt.push_back(1);
	lt.push_back(2);
	lt.push_back(3);
	lt.push_back(4);
	// 正向迭代器
	list<int>::iterator it = lt.begin();
	while (it!=lt.end())
	{
		cout << *it << " ";
		++it;
	}
	cout << endl;
	// 反向迭代器
	list<int>::reverse_iterator rit = lt.rbegin();
	while (rit!=lt.rend())
	{
		cout << *rit << " ";
		++rit;
	}
}

void test_list3()
{
	list<int> l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	cout << l1.size() << endl; // 4
	cout << l1.empty() << endl;// 0
}

void test_list4()
{
	list<int> l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	cout << l1.front() << endl; // 1
	cout << l1.back() << endl;  // 4
}

void test_list5()
{
	list<int> l;
	l.push_back(1);
	l.push_front(2);
	list<int>::iterator it = l.begin();
	++it;
	l.insert(it, 20);
	for (int e : l)
	{
		cout << e << " ";
	}
	cout << endl;
	cout << "------" << endl;
	l.clear();
	for (int e : l)
	{
		cout << e << " ";
	}
}

void test_list6()
{
	list<int> l1;
	l1.push_back(1);
	l1.push_back(7);
	l1.push_back(3);
	l1.push_back(3);
	l1.push_back(3);
	l1.push_back(4);
	// 排序
	l1.sort();
	for (int e : l1)
	{
		cout << e << " ";
	}
	cout << endl;
	// 逆置
	l1.reverse();
	for (int e : l1)
	{
		cout << e << " ";
	}
	cout << endl;
	// 去重
	l1.unique();
	for (int e : l1)
	{
		cout << e << " ";
	}
	cout << endl;
	// 删除给定的一个值
	l1.remove(7);
	for (int e : l1)
	{
		cout << e << " ";
	}
	cout << endl;
}