【C++进阶】深入STL之list：高效双向链表的使用技巧

int main()
{
    list<int> lt1(10, 5); //构造的list中包含n个值为val的元素
    list<int> lt2; // 构造空的list
    list<int> lt3(lt1); // 拷贝构造函数
    list<int> lt4(lt1.begin(), lt1.end()); // 用迭代器区间中的元素构造list
    return 0;
}

int main()
{
    list<int> lt(10, 5);
	list<int>::iterator it = lt.begin();
    while (it != lt.end())
    {
        cout << *it << " ";
        it++;
    }
    return 0;
}

int main()
{
	list<int> lt1 = { 2,3,4,5 };
	lt1.push_back(6);
	lt1.push_front(1);

	// 将值为100的元素用insert插入lt1;
	lt1.insert(++lt1.begin(), 100);

	// 用erase删除lt1中的一个头部元素
	auto it1 = lt1.begin();
    it1 = lt1.erase(lt1.begin());
	// auto it1 = lt1.begin(); // 这里出现了迭代器失效
	while (it1 != lt1.end())
	{
		cout << *it1 << " ";
	    it1++;
	}
	    cout << endl;
	return 0;
}

int main()
{
	list<int> lt1 = { 1,4,3,2,5 };
	list<int> lt2 = { 6,9,8,7,0 };

	cout << "lt1: ";
	for (auto e : lt1)
	{
		cout << e << " ";
	}
	cout << endl;
	cout << "lt2: ";
	for (auto e : lt2)
	{
		cout << e << " ";
	}
	cout << endl;
	lt1.swap(lt2); // 交换两个容器里面的元素
	cout << "lt1(after swap): ";
	for (auto e : lt1)
	{
		cout << e << " ";
	}
	cout << endl;
	cout << "lt2(after swap): ";
	for (auto e : lt2)
	{
		cout << e << " ";
	}
	cout << endl;
	cout << "clear lt2";
	cout << endl;
	lt2.clear(); // 清除lt2中的元素
	cout << "lt1: ";
	for (auto e : lt1)
	{
		cout << e << " ";
	}
	cout << endl;

	cout << "lt2: ";
	for (auto e : lt2)
	{
		cout << e << " ";
	}
	cout << endl;

	lt1.sort(); // 将lt1中的元素排序
	cout << endl;
	cout << "after sort lt1: ";
	for (auto e : lt1)
	{
		cout << e << " ";
	}
	cout << endl;
	return 0;
}

void test_list()
{
	list<int> l= { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
	auto it = l.begin();
	while (it != l.end())
	{
	// erase()函数执行后，it所指向的节点已被删除，因此it无效，在下一次使用it时，必须先给其赋值
		l.erase(it);
		++it;
	}
}

void test_list()
{
	list<int> l= { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
	auto it = l.begin();
	while (it != l.end())
	{
		it = l.erase(it);
	}
}