List容器

一、List容器构造函数

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容器
	list<int> l1;

	//添加数据
	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(40);
	l1.push_back(50);

	//遍历容器
	printList(l1);

	//区间构造
	list<int> l2(l1.begin(), l1.end());
	printList(l2);

	//拷贝构造
	list<int> l3(l2);
	printList(l3);

	list<int> l4(10, 1000);
	printList(l4);
}

int main() {
	test01();
	return 0;
}

二、List赋值和交换

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> l1;
	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(40);

	cout << "交换前l1为：";
	printList(l1);

	list<int> l2;
	l2 = l1;
	printList(l2);

	list<int>l3;
	l3.assign(l2.begin(), l2.end());
	printList(l3);

	cout << "交换前l4为：";
	list<int>l4;
	l4.assign(10, 1000);
	printList(l4);

	l1.swap(l4);
	cout << "交换后l1为：";
	printList(l1);
	cout << "交换后l4为：";
	printList(l4);


}

int main() {
	test01();
	return 0;
}

三、List大小和操作

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> l1;

	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(40);

	printList(l1);

	//判断容器是否为空
	if (l1.empty())
	{
		cout << "容器为空" << endl;
	}
	else
	{
		cout << "容器不为空" << endl;
		cout << "容器的元素个数为：" <<l1.size()<< endl;
	}
	//重新指定大小
	l1.resize(10, 10000);
	printList(l1);

	l1.resize(2);
	printList(l1);
}

int main() {
	test01();
	return 0;
}

四、List插入和删除

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> l1;

	//尾插
	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);

	//头插
	l1.push_front(100);
	l1.push_front(200);
	l1.push_front(300);
	printList(l1);

	//尾删
	l1.pop_back();
	printList(l1);

	//头删
	l1.pop_front();
	printList(l1);

	//insert插入
	list<int>::iterator it = l1.begin();
	l1.insert(++it,1000);
	printList(l1);

	//删除
	it = l1.begin();
	l1.erase(it);
	printList(l1);

	//移除
	l1.push_back(10000);
	l1.push_back(10000);
	printList(l1);
	l1.remove(10000);
	printList(l1);
}

int main() {
	test01();
	return 0;
}

五、List数据存取

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> l1;
	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(40);

	printList(l1);

	cout << "第一个元素：" << l1.front() << endl;
	cout << "最后一个元素：" << l1.back() << endl;

	list<int>::iterator it = l1.begin();
	it++;//it = it + 1，因为是链表，只支持双向一个一个走，不能随机访问

}

int main() {
	test01();
	return 0;
}

六、List反转和排序

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> l1;
	l1.push_back(20);
	l1.push_back(10);
	l1.push_back(40);
	l1.push_back(30);

	cout << "反转前：";
	printList(l1);

	//反转
	l1.reverse();
	cout << "反转后：";
	printList(l1);
}

void test02()
{
	list<int> l1;

	l1.push_back(40);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(60);
	l1.push_back(50);

	cout << "排序前：";
	printList(l1);


	//不支持随机访问迭代器的容器，内部会提供对应一些算法
	l1.sort();
	cout << "排序后：";
	printList(l1);
}

int main() {
	test01();
	test02();
	return 0;
}