queue容器 stack容器 list容器谓词内接函数对象容器接口基本都一样

stack容器-基本概念

stack容器-常用接口

queue容器-基本概念

queue容器-常用接口

list容器-基本概念链表

list容器-构造函数

list容器-赋值和交换

list容器-大小操作

list容器-插入和删除

list容器-数据存取不能用[] 和at();
list容器-反转和排序
list容器-排序案例


#include<iostream>
using namespace std;
#include <list>
#include <string>

//list 容器 对自定义数据类型 排序
class Person {
public:
	Person(string name, int age, int height)
	{
		this->m_Name = name;
		this->m_Age = age;
		this->m_Height = height;
	}

	string m_Name;
	int m_Age;
	int m_Height;
};

//指定sort排序规则
bool comparePer(Person &p1,Person &p2) {
	//按照年龄做升序 相同年龄做身高降序
	if (p1.m_Age == p2.m_Age)
	{
		return p1.m_Height > p2.m_Height;
	}
	return p1.m_Age < p2.m_Age;
}
void test01()
{
	list<Person>L;//创建容器

	//准备数据
	Person p1("刘备", 35, 175);
	Person p2("曹操", 45, 180);
	Person p3("孙权", 40, 170);
	Person p4("赵云", 25, 190);
	Person p5("张飞", 35, 160);
	Person p6("关于", 35, 200);

	//插入数据
	L.push_back(p1);
	L.push_back(p2);
	L.push_back(p3);
	L.push_back(p4);
	L.push_back(p5);
	L.push_back(p6);

	for (list<Person>::iterator it = L.begin(); it != L.end(); it++)
	{
		cout << "姓名: " << (*it).m_Name << " 年龄: " << it->m_Age << " 身高: " << it->m_Height << endl;
	}
	//排序
	cout << "---------------------------------"<<endl<<"排序后:  " << endl;

	L.sort(comparePer);
	for (list<Person>::iterator it = L.begin(); it != L.end(); it++)
	{
		cout << "姓名: " << (*it).m_Name << " 年龄: " << it->m_Age << " 身高: " << it->m_Height << endl;
	}

}

int main() {

	test01();

	system("pause");

	return 0;

}