【C++】C++提高编程部分-泛型编程-STL

template<typename T>
函数声明或定义

#include<iostream>
using namespace std;


//函数模板
//两个整型交换
void  SwapInt(int &a, int &b)
{
	int temp = b;
	b = a;
	a = temp;
}
//两个浮点型交换
void SwapDouble(double &a,double & b)
{
	double temp = a;
	a = b;
	b = temp;
}


//函数模板
//声明一个模板,告诉编译器后面的代码中紧跟着的T不要报错，T是一个通用数据类型
template<typename T>
void MySwap(T& a, T& b)
{
	T Temp = a;
	a = b;
	b = Temp;
}

void test01()
{
	int a = 10;
	int b = 20;
	//利用函数模板进行交换
	//1.自动类型推导
	MySwap(a, b);

	cout << a  << endl;
	cout << b << endl;

	double c = 11.1;
	double d = 12.2;
	//显示指定类型
	MySwap<double>(c, d);
	cout << c << endl;
	cout << d << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
using namespace std;
//实现通用 对数组进行排序的函数
//规则 从大到小
//算法 选择 
//测试 char 数组 int 数组
//交换的函数模板
template<class T>
void mySwap(T& a, T& b)
{
	T temp = a;
	a = b;
	b = temp;
}

template<class T>
void mySort(T arr[],int len)
{
	for (int i =  0; i < len; i++)
	{
		int max = i;//认定最大值的下标
		for (int j = i + 1; j < len; j++)
		{
			//认定的最大值比遍历出的数值要小，说明j下标的元素才是真正的最大值
			if (arr[max] < arr[j])
			{
				max = j;
			}
		}
		if (max != i)
		{
			//交换max和i元素
			mySwap(arr[max], arr[i]);
		}
	}
}

//打印数组模板
template<class T>
void myPrint(T arr[], int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i]<< endl;
	}
}

void test01()
{
	char charArr[] = "badcfe";
	int num = sizeof(charArr) / sizeof(char);
	mySort(charArr, num);
	myPrint(charArr, num);
}
void test02()
{
	int intArr[] = {2,3,78,9,7};
	int num = sizeof(intArr) / sizeof(int);
	mySort(intArr, num);
	myPrint(intArr, num);
}
int main(void)
{
	test01(); 
	test02();
	return 0;
}

#include<iostream>
using namespace std;
//普通函数与函数模板的区别
//普通函数调用可以发生隐式类型转换
//函数模板用自动类型推导不可以发生隐式类型转换
// 函数模板用显式指定类型 可以发生隐式类型转换

//普通函数隐式类型转换
int myAdd01(int a, int b)
{
	return a + b;
}


//函数模板
template<class T>
T myAdd02(T a, T b)
{
	return a + b;
}



void test01()
{
	int a = 10;
	int b = 20;
	char c = 'c';
	cout << myAdd01(a, c) << endl;

	//自动类型推导不行
	//cout << myAdd02(a, c) << endl;

	//显式指定类型行
	cout << myAdd02<int>(a, c) << endl;
}


int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
using namespace std;
void myPrint(int a, int b)
{
	cout << "调用普通函数" << endl;
}
template<class T>
void myPrint(T a, T b)
{
	cout << "调用模板" << endl;
}

template<class T>
void myPrint(T a, T b,T c)
{
	cout << "调用重载模板" << endl;
}
void test01()
{
	int a = 10;
	int b = 20;
	//如果函数模板和普通函数都可以调用。优先调用普通函数。普通函数只有声明会报错
	myPrint(a, b);

	//通过空模板的参数列表强制调用函数模板
	myPrint<>(a,b);

	//调用重载模板
	myPrint(a, b, 100);

	//如果函数模板产生更好的匹配，优先调用函数模板
	char c1 = 'a';
	char c2 = 'b';

	myPrint(c1, c2);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

template<class T>
void f(T a,T b)
{
    a = b;
}

template<class T>
void f(T a,T b)
{
    if(a>b)
    {......}
}

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

class Person
{
public:
	Person(string name,int age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}

	string m_Name;
	int m_Age;
};

//模板并不是万能的，有些特定的数据类型，需要用具体化方式做特殊实现
//对比两个数据是否相等
template<class T>
bool myCompare(T& a, T& b)
{
	if (a == b)
	{
		return true;
	}
	else
	{
		return false;
	}
}

//利用具体化Person的版本来实现代码，具体优化优先调用
template<>bool myCompare(Person& p1, Person& p2)
{
	if (p1.m_Name == p2.m_Name && p1.m_Age == p2.m_Age)
	{
		return true;
	}
	else
	{
		return false;
	}
}
void test01()
{
	int a = 10;
	int b = 20;
	bool ret = myCompare(a, b);
	if (ret)
	{
		cout << "相等" << endl;
	}
	else
	{
		cout << "不相等" << endl;
	}
}

void test02()
{

	Person p1("Tom", 10);
	Person p2("Tom", 10);

	bool ret = myCompare(p1, p2);
	if (ret)
	{
		cout << "相等" << endl;
	}
	else
	{
		cout << "不相等" << endl;
	}
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

template<typename T>类

#include<iostream>
#include<string>
using namespace std;
//类模板
template<class NameType,class AgeType>
class Person
{
public:
	Person(NameType name, AgeType age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	void showPerson()
	{
		cout << this->m_Name << this->m_Age << endl;
	}
	NameType m_Name;
	AgeType m_Age;
};
void test01()
{
	// <>中是模板的参数列表
	Person<string, int>p1("张三",10);
	p1.showPerson();
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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


template<class NameType, class AgeType = int>//默认参数
class Person
{
public:
	Person(NameType name,AgeType age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}
	void ShowPerson()
	{
		cout << this->m_Name << this->m_Age << endl;
	}
	NameType m_Name;
	AgeType m_Age;
};

//类模板没有自动类型推导的使用方式
void test01()
{
	//Person p("李四", 13);
	Person<string,int>p("李四", 13);//只能用显示指定类型
	p.ShowPerson();
}

//类模板在模板参数列表中可以有默认参数
void test02()
{
	Person<string>p2("张三", 13);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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

//类模板中的成员函数在调用时才去创建
class Person1 
{
public:
	void showPerson1()
	{
		cout << "Person show1" << endl;
	}
};

class Person2
{
public:
	void showPerson2()
	{
		cout << "Person show2" << endl;
	}
};
template<class T>
class MyClass
{
public:
	T obj;
	//类模板中的成员函数
	void func1()
	{
		obj.showPerson1();
	}
	void func2()
	{
		obj.showPerson2();
	}
};

void test01()
{
	MyClass<Person2>m;
	m.func1();
	//m.func2();
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
using namespace std;

//类模板对象做函数参数
template<class T1,class T2>
class Person
{
public:
	Person(T1 name,T2 age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}

	void showPerson()
	{
		cout << this->m_Name << this->m_Age << endl;
	}
	T1 m_Name;
	T2 m_Age;
};
//1.指定传入类型
void PrintPerson1(Person<string,int>&p)
{
	p.showPerson();
}
void test01()
{
	Person<string, int>p1("张三",11);
	PrintPerson1(p1);
}
//2.参数模板化
template<class T1,class T2>
void PrintPerson2(Person<T1, T2>&p)
{
	p.showPerson();
	cout << "T1的数据类型为" << typeid(T1).name() << endl;
	cout << "T2的数据类型为" << typeid(T2).name() << endl;
}

void test02()
{
	Person<string, int>p2("李四", 12);
	PrintPerson2(p2);
}
//3.整个类模板化
template<class T>
void PrintPerson3(T &p)
{
	p.showPerson();
	cout << "T的数据类型为" << typeid(T).name() << endl;
	
}
void test03()
{
	Person<string, int>p3("赵四", 14);
	PrintPerson3(p3);
}
int main(void)
{
	test01();
	test02();
	test03();
	system("pause");
	return 0;
}

#include<iostream>
using namespace std;

//类模板与继承
template<class T>
class Base
{
	T m;
};
class Son :public Base<int>//必须要知道父类中T的数据类型才能继承给子类
{

};
void test01()
{
	Son s1;
}

//如果想灵活指定父类中T类型，子类也需要变类模板
template<class T1,class T2>
class Son2 :public Base<T2>
{
public:
	Son2()
	{
		cout << typeid(T1).name()<< endl;
		cout << typeid(T2).name()<< endl;
	}
	T1 obj;
};
void test02()
{
	Son2<int, char>s2;
}
int main(void)
{
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
using namespace std;
//类模板成员函数类外实现
template<class T1,class T2 >
class Person
{
public:
	Person(T1 name, T2 age);

	void showPerson();

	T1 m_Name;
	T2 m_Age;
};
//构造函数类外实现
template<class T1,class T2>
Person<T1,T2>::Person(T1 name, T2 age)
{
	this->m_Name = name;
	this->m_Age = age;
}

//成员函数类外实现
template<class T1,class T2>
void Person<T1,T2>::showPerson()
{
	cout << this->m_Name << this->m_Age << endl;
}
void test01()
{
	Person<string, int>p1("新二", 13);
	p1.showPerson();
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#pragma once
#include<iostream>
using namespace std;

template<class T1, class T2>
class Person
{
public:
	Person(T1 name, T2 age);
	void showPerson();
	T1 m_Name;
	T2 m_Age;
};

template<class T1, class T2>
Person<T1, T2>::Person(T1 name, T2 age)
{
	this->m_Name = name;
	this->m_Age = age;
}
template<class T1, class T2>
void Person<T1, T2>::showPerson()
{
	cout << this->m_Name << this->m_Age << endl;
}

#include<iostream>
#include"Person.hpp"
using namespace std;
#include<string>

void test01()
{
	Person<string, int>p1("伞兵", 18);
	p1.showPerson();
}
int main(void)
{
	test01();
	system("pause"); 
	return 0;
}

#include<iostream>
#include<string>
using namespace std;
//通过全局函数打印Person的信息

//提前让编译器知道Person类的存在
template<class T1, class T2 >
class Person;
//类外实现
template<class T1, class T2>
void PrintPerosn2(Person<T1, T2>p)
{
	cout << "类外实现" << p.m_Name << p.m_Age < endl;
}


template<class T1,class T2 >
class Person
{
	//全局函数类内实现
	friend void PrintPerosn(Person<T1,T2>p)
	{
		cout << p.m_Name << p.m_Age << endl;
	}

	//全局函数类外实现
	//加空模板参数列表
	//如果全局函数 是类外实现 需要让编译器提前知道这个函数的存在
	friend void PrintPerosn2<>(Person<T1, T2>p);


public:
	Person(T1 name,T2 age)
	{
		this->m_Name = name;
		this->m_Age = age;
		
	}
private:
	T1 m_Name;
	T2 m_Age;
};

void test01()
{
	Person<string, int>p("zbc", 12);
	PrintPerosn(p);
}
void test02()
{
	Person<string, int>p2("年轻人", 18);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

//自己的通用的数组类
#pragma once 
#include<iostream>
using namespace std;

template<class T>
class MyArry
{
public:
	//有参构造 参数 容量
	MyArry(int capacity)
	{
		//cout << "MyArry的有参构造调用" << endl;
		this->m_Capacity = capacity;
		this->m_Size = 0;
		this->pAddress = new T[this->m_Capacity];
	}

	//拷贝构造
	MyArry(const MyArry& arr)
	{
		//cout << "MyArry的拷贝构造调用" << endl;

		this->m_Capacity = arr.m_Capacity;
		this->m_Size = arr.m_Size;
		//this->pAddress = arr.pAddress;

		//深拷贝
		this->pAddress = new T[arr.m_Capacity];
		
		//将arr中的数据都拷贝过来
		for (int i = 0; i < this->m_Size; i++)
		{
			this->pAddress[i] = arr.pAddress[i];
		}
	}
	//operator= 防止浅拷贝问题
	MyArry& operator =(const MyArry& arr)
	{

		//cout << "MyArry的operator=调用" << endl;

		//先判断原来堆区是否有数据，如果有先释放
		if (this->pAddress != NULL)
		{
			delete[] this->pAddress;
			this->pAddress = NULL;
			this->m_Capacity = 0;
			this->m_Size = 0;
		}

		//深拷贝
		this->m_Capacity = arr.m_Capacity;
		this->m_Size = arr.m_Size;
		this->pAddress = new T[arr.m_Capacity];
		for (int i = 0; i < this->m_Size; i++)
		{
			this->pAddress[i] = arr.pAddress[i];
		}
		return *this;
	}


	//尾插法
	void PushBack(const T& val)
	{
		//判断容量是否等于大小
		if (this->m_Capacity == this->m_Size)
		{
			return;
		}
		this->pAddress[this->m_Size] = val;//在数组末尾插入数据
		this->m_Size++;//更新数组大小

	}
	//尾删法
	void PopBack()
	{
		//让用户访问不到最后一个元素，即为尾删，逻辑删除
		if (this->m_Size == 0)
		{
			return;
		}
		this->m_Size--;
	}

	//通过下标的方式访问数组中的元素
	T& operator[](int index)
	{

		return this->pAddress[index];
	}

	//返回数组容量
	int getCapacity()
	{
		return this->m_Capacity;
	}

	//返回数组大小
	int getSize()
	{
		return this->m_Size;
	}

	//析构函数
	~MyArry()
	{	
		if (this->pAddress != NULL)
		{
			//cout << "MyArry的析构函数调用" << endl;
			delete[] this->pAddress;
			this->pAddress = NULL;
		}
	}

private:
	T* pAddress;//指针指向堆区开辟的真实数组

	int m_Capacity;//数组容量

	int m_Size;//数组大小
};

#include<iostream>
#include"MyArray.hpp"
#include<string>
using namespace std;

void PrintArry(MyArry <int> &arr)
{
	for (int i = 0; i < arr.getSize(); i++)
	{
		cout << arr[i] << endl;
	}
}
void test01()
{
	MyArry <int>arr1(5);

	for (int i = 0; i < 5; i++)
	{
		//利用尾插法向数组中插入数据
		arr1.PushBack(i);
	}

	cout << "arr1的打印输出" << endl;
	PrintArry(arr1);
	cout << "arr1的容量为" << arr1.getCapacity() << endl;
	cout << "arr1的大小为" << arr1.getSize() << endl;
	
	
	cout << "arr2的打印输出" << endl;
	MyArry <int>arr2(arr1);
	PrintArry(arr2);

	//尾删
	arr2.PopBack();
	cout << "arr2尾删后" << endl;
	cout << "arr2的容量为" << arr2.getCapacity() << endl;
	cout << "arr2的大小为" << arr2.getSize() << endl;

	/*MyArry<int>arr3(100);

	arr3 = arr1;*/

}





//测试自定义数据类型 
class Person
{
public:
	Person(){};
	Person(string name,int age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}
	string m_Name;
	int m_Age;
};

void PrintPersonArry(MyArry<Person>& arr)
{
	for (int i = 0; i < arr.getSize(); i++)
	{
		cout << "姓名" << arr[i].m_Name << "年龄" << arr[i].m_Age << endl;
	}
}

void test02()
{
	MyArry<Person>arr(10);
	Person p1("伞兵1", 21);
	Person p2("伞兵2", 22);
	Person p3("伞兵3", 23);
	Person p4("伞兵4", 24);
	Person p5("伞兵5", 25);

	//将数据插入到数组中
	arr.PushBack(p1);
	arr.PushBack(p2);
	arr.PushBack(p3);
	arr.PushBack(p4);
	arr.PushBack(p5);

	//打印数组
	PrintPersonArry(arr);
	//输出容量
	cout << "arr容量为" << arr.getCapacity() << endl;
	//输出大小
	cout << "arr大小为" << arr.getSize() << endl;
}


int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>//标准算法的头文件
using namespace std;

void myPrint(int val)
{
	cout << val << endl;
}

void test01()
{
	//创建了一个vector容器，数组
	vector<int>v;
	//向容器中插入数据
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	
	//通过迭代器来访问容器中的数据
	//vector<int>::iterator itBegin = v.begin();//起始迭代器，指向容器中第一个元素
	//vector<int>::iterator itEnd = v.end();//结束迭代器，指向容器中最后一个元素的下一个位置
	//
	//第一种遍历方式 
	//while (itBegin != itEnd)
	//{
	//	cout << *itBegin << endl;
	//	itBegin++;
	//}

	//第二种遍历方式
	/*for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << endl;
	}*/


	//第三种遍历方式 利用STL提供遍历算法
	for_each(v.begin(), v.end(), myPrint);


}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>//标准算法的头文件
using namespace std;

//vector中存放自定义数据类型
class Person
{
public:
	Person(string name,int age )
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	string m_Name;
	int m_Age; 
};
void test01()
{
	vector<Person>v;
	Person p1("a1", 10);
	Person p2("a2", 10);
	Person p3("a3", 10);
	Person p4("a4", 10);
	Person p5("a5", 10);
	//向容器中添加数据
	v.push_back(p1);
	v.push_back(p2);
	v.push_back(p3);
	v.push_back(p4);
	v.push_back(p5);


	//遍历容器中的数据
	for (vector<Person>::iterator it = v.begin(); it != v.end(); it++)
	{
		//cout << "姓名:" << (*it).m_Name << "年龄:" << (*it).m_Age << endl;
		cout << "姓名:" << it->m_Name << "年龄:" << it->m_Age << endl;
	}
}

//存放自定义数据类型的指针
void test02()
{
	vector<Person*>v;
	Person p1("a1", 10);
	Person p2("a2", 10);
	Person p3("a3", 10);
	Person p4("a4", 10);
	Person p5("a5", 10);
	//向容器中添加数据
	v.push_back(&p1);
	v.push_back(&p2);
	v.push_back(&p3);
	v.push_back(&p4);
	v.push_back(&p5);


	//遍历迭代器
	for (vector<Person*>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << "姓名:" << (*it)->m_Name << "年龄:" << (*it)->m_Age << endl;
	}
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
//容器嵌套容器

void test01()
{
	vector<vector<int>>v;
	//创建小容器
	vector<int>v1;
	vector<int>v2;
	vector<int>v3;
	vector<int>v4;

	//向小容器中添加数据
	for (int i = 0; i < 4; i++)
	{
		v1.push_back(i + 1);
		v2.push_back(i + 2);
		v3.push_back(i + 3);
		v4.push_back(i + 4);
	}
	//将小容器插入到大容器中
	v.push_back(v1);
	v.push_back(v2);
	v.push_back(v3);
	v.push_back(v4);

	//通过大容器遍历所有数据
	for (vector<vector<int>>::iterator it = v.begin(); it != v.end(); it++)
	{
		for (vector<int>::iterator vit = (*it).begin(); vit != (*it).end(); vit++)
		{
			cout << *vit << " ";
		}
		cout << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

//string的构造函数
void test01()
{
	string s1;//默认构造
	const char* str = "hellow world";
	string s2(str);
	cout << "s2："<<s2 << endl;

	string s3(s2);
	cout << "s3" << s3 << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

void test01()
{
	string str1;
	str1 = "hello world";
	cout << "str1=" << str1 << endl;

	string str2;
	str2 = str1;
	cout << "str2=" << str2 << endl;
	
	string str3;
	str3 = 'c';
	cout << "str3=" << str3 << endl;

	string str4;
	str4.assign("hello c艹");
	cout << "str4=" << str4 << endl;

	string str5;
	str5.assign("hello c++",5);
	cout << "str5=" << str5 << endl;
	
	string str6;
	str6.assign(str5);
	cout << "str6=" << str6 << endl;

	string str7;
	str7.assign(10, 'w');
	cout << "str7=" << str7 << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

void test01()
{
	string str1 = "你";
	str1 += "是伞兵";
	cout << "str1=" << str1<< endl;

	str1 += '?';
	cout << "str1=" << str1 << endl;

	string str2 = "zbc";
	str1 += str2;
	cout << "str1=" << str1 << endl;

	string str3 = "You";
	str3.append(" SB");
	cout << "str3=" << str3 << endl;

	str3.append("hahaha hahaha", 4);
	cout << "str3=" << str3 << endl;

	str3.append(str2);
	cout << "str3=" << str3 << endl;

	str3.append(str2, 0, 1);
	cout << "str3=" << str3 << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

//字符串的查找和替换
//查找
void test01()
{
	string str1 = "abcdefg";
	//找到返回下标，找不到返回-1
	int pos1 = str1.find("de");
	cout << "pos1=" << pos1 << endl;
	int pos2 = str1.find("z");
	cout << "pos2=" << pos2<< endl;

	pos1 = str1.rfind("ab");//从右往左
	cout << "pos1=" << pos1 << endl;;
}

void test02()
{
	string str2 = "abcdef";
	str2.replace(1, 3, "1111");//从1号位置起，3个字符替换为1111
	cout << "str2=" << str2 << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

=返回0>返回1<返回-1

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

//字符串比较
void test01()
{
	string str1 = "zello";
	string str2 = "hello";
	if (str1.compare(str2) == 0)
	{
		cout << "相等" << endl;
	}
	else if (str1.compare(str2) > 0)
	{
		cout << "str1大" << endl;
	}
	else
	{
		cout << "str2大" << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

//string字符存取
void test01()
{
	string str1 = "hello";
	//通过[]访问单个字符
	for (int i = 0; i < str1.size(); i++)
	{
		cout << str1[i] << " ";
	}
	cout << endl;
	//通过at方式访问的单个字符
	for (int i = 0; i < str1.size(); i++)
	{
		cout << str1.at(i) << " ";
	}
	cout << endl;

	//修改单个字符
	str1[0] = 'z';
	cout << str1 << endl;

	str1.at(0) = 'x';
	cout << str1 << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
//字符串 插入和删除
void test01()
{
	string str = "hello";
	//插入
	str.insert(1, "111");
	cout << "str = " << str << endl;

	//删除
	str.erase(1,3);
	cout << "str = " << str << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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

//string求字串
void test01()
{
	string str = "abcdef";
	string subStr = str.substr(1, 3);
	cout << "subStr=" << subStr << endl;
}
//使用操作
void test02()
{
	string email = "zhangsan@qq.com";
	//从邮箱地址中获取用户名信息
	int pos = email.find("@");
	string usrName = email.substr(0, pos);
	cout << usrName << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;

void printVector(vector<int>& v)
{
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}

//vector容器构造
void test01()
{
	vector<int>v1;//默认构造 无参构造
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}
	printVector(v1);

	//通过区间的方式进行构造
	vector<int>v2(v1.begin(), v1.end());
	printVector(v2);
	
	//n个elem方式构造
	vector<int>v3(10, 100);//10个100
	printVector(v3);

	//拷贝构造
	vector<int>v4(v3);
	printVector(v4);
}

int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
//vector赋值
void PrintVector(vector<int>& v)
{
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	vector<int>v1;
	for (int i = 0; i < 10;i++)
	{
		v1.push_back(i);
	}
	PrintVector(v1);

	//赋值 operator= 
	vector<int>v2;
	v2 = v1;
	PrintVector(v2);

	//assign
	vector<int>v3;
	v3.assign(v1.begin(), v1.end());//闭 开
	PrintVector(v3);

	//n个elem方式赋值
	vector<int>v4;
	v4.assign(10, 100);//10个100
	PrintVector(v4);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
//vector容器的容量和大小操作
void PrintVector(vector<int>& v)
{
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	vector<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}
	PrintVector(v1);

	if (v1.empty())
	{
		cout << "空" << endl;
	}
	else
	{
		cout << "不空" << endl;
	}

	cout << "v1的容量=" << v1.capacity() << endl;
	cout << "v1的大小=" << v1.size() << endl;
	
	//重新指定大小
	v1.resize(15,100);//利用重载版本，可以指定默认填充值，第二个参数
	PrintVector(v1);//如果重新指定的比原来的长，默认用0填充

	v1.resize(5);
	PrintVector(v1);//如果重新指定的比原来短，超出的部分会删除掉
}
int main(void) 
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

//vector容器的插入和删除
void PrintVector(vector<int>& v)
{
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}

void test01()
{
	vector<int>v1;
	
	//尾插法
	v1.push_back(10);
	v1.push_back(20);
	v1.push_back(30);
	v1.push_back(40);
	v1.push_back(50);
	
	//遍历
	PrintVector(v1);

	//尾删
	v1.pop_back();
	PrintVector(v1);

	//插入
	v1.insert(v1.begin(), 100);
	PrintVector(v1);

	v1.insert(v1.begin(), 2, 1000);
	PrintVector(v1);

	//删除 参数也是迭代器
	v1.erase(v1.begin());
	PrintVector(v1);

	//清空
	//v1.erase(v1.begin(), v1.end());
	v1.clear();
	PrintVector(v1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

//vector容器 数据存取
void test01()
{

	vector<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}	
	//利用[]访问数组中的元素
	for (int i = 0; i < v1.size(); i++)
	{
		cout << v1[i] << " ";
	}
	cout << endl;

	//利用at方式访问元素
	for (int i = 0; i < v1.size(); i++)
	{
		cout << v1.at(i) << " ";
	}
	cout << endl;
	
	//获取第一个元素
	cout << "第一个元素=" << v1.front() << endl;

	//获取最后一个元素
	cout << "最后一个元素=" << v1.back()<<endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

//vector容器互换

void PrintVector(vector<int> &v)
{
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}

void test01()
{
	vector<int>v1;
	cout << "交换前" << endl;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}
	PrintVector(v1);
	vector<int>v2;

	for (int i = 10; i > 0; i--)
	{
		v2.push_back(i);
	}
	PrintVector(v2);
	cout << "交换后" << endl;

	v1.swap(v2);

	PrintVector(v1);
	PrintVector(v2);
}


//实际 用途
//巧用swap可以收缩内存空间
void test02()
{
	vector<int>v;
	for (int i = 0; i < 10000; i++)
	{
		v.push_back(i);
	}

	cout << "容量" << v.capacity() << endl;
	cout << "大小" << v.size() << endl;
	cout <<  endl;
	v.resize(3);//重新指定大小
	cout << "容量" << v.capacity() << endl;
	cout << "大小" << v.size() << endl;


	//巧用swap收缩内存
	vector<int>(v).swap(v);
	cout << endl;
	cout << "容量" << v.capacity() << endl;
	cout << "大小" << v.size() << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

//vector容器 预留空间
void test01()
{
	vector<int>v1;
	int num = 0;//统计开辟次数
	int* p = NULL;
	for (int i = 0; i < 100000; i++)
	{
		v1.push_back(i);
		
		if (p != &v1[0])
		{
			p = &v1[0];
			num++;
		}
	}
	cout << num << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>d1;
	for (int i = 0; i < 10; i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);

	deque<int>d2(d1.begin(), d1.end());
	PrintDeque(d2);

	deque<int>d3(10, 100);
	PrintDeque(d3);

	deque<int>d4(d3);
	PrintDeque(d4);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>d1;
	for (int i = 0; i < 10; i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);

	//operator=赋值
	deque<int>d2;
	d2 = d1;
	PrintDeque(d2);

	//assign赋值
	deque<int>d3;
	d3.assign(d1.begin(),d1.end());
	PrintDeque(d3);

	deque<int>d4;
	d4.assign(10, 100);
	PrintDeque(d4);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>d1;
	for (int i = 0; i < 10; i++)
	{
		d1.push_back(i);
	}
	PrintDeque(d1);
	if (d1.empty())
	{
		cout<<"空"<<endl;
	}
	else
	{
		cout<<"不空"<<endl;
	}
	//deque容器没有容量概念
	cout << "大小" << d1.size() << endl;

	//重新指定大小,并填充
	d1.resize(15,1);
	PrintDeque(d1);

	d1.resize(5);
	PrintDeque(d1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
//两端操作
void test01()
{
	deque<int>d1;
	//尾插
	d1.push_back(10);
	d1.push_back(20);

	//头插
	d1.push_front(100);
	d1.push_front(200);

	PrintDeque(d1);
	//尾删
	d1.pop_back();
	PrintDeque(d1);

	//头删
	d1.pop_front();
	PrintDeque(d1);
}

void test02()
{
	deque<int>d2;
	//尾插
	d2.push_back(10);
	d2.push_back(20);

	//头插
	d2.push_front(100);
	d2.push_front(200);

	PrintDeque(d2);

	//insert插入
	d2.insert(d2.begin(), 1000);
	PrintDeque(d2);

	d2.insert(d2.begin(), 2,10000);
	PrintDeque(d2);

	//按照区间进行插入
	deque<int>d3;
	d3.push_back(1);
	d3.push_back(2);
	d3.push_back(3);

	d2.insert(d2.begin(), d3.begin(), d3.end());
	PrintDeque(d2);
}

void test03()
{


	deque<int>d4;
	//尾插
	d4.push_back(10);
	d4.push_back(20);

	//头插
	d4.push_front(100);
	d4.push_front(200);

	PrintDeque(d4);

	//删除
	deque<int>::iterator it = d4.begin();
	it++;
	d4.erase(it);
	PrintDeque(d4);
	
	//按照区间方式删除
	d4.erase(d4.begin(), d4.end());
	PrintDeque(d4);
	//清空
	d4.clear();
	PrintDeque(d4);
}
int main(void)
{
	test01();
	test02();
	test03();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>d1;
	for (int i = 0; i < 3; i++)
	{
		d1.push_back(i);
	}
	d1.push_front(100);
	d1.push_front(200);
	d1.push_front(300);
	
	//通过[]方式访问元素
	for (int i = 0; i < d1.size(); i++)
	{
		cout << d1[i] << " ";
	}
	cout << endl;
	//通过at方式访问元素
	for (int i = 0; i < d1.size(); i++)
	{
		cout << d1.at(i) << " ";
	}
	cout << endl;

	cout << "第一个元素=" << d1.front() << endl;
	cout << "最后一个元素=" << d1.back() << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<deque>
#include<algorithm>//标准算法头文件
using namespace std;
void PrintDeque(const deque<int>& d)
{
	for (deque<int>::const_iterator it = d.begin(); it != d.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	deque<int>d1;
	d1.push_back(10);
	d1.push_back(20);
	d1.push_back(30);
	d1.push_front(100);
	d1.push_front(200);
	d1.push_front(300);

	PrintDeque(d1);
	
	//排序-默认升序
	//对于支持随机访问的迭代器容器，都可以用sort算法对其进行排序
	//vector容器也可以利用sort进行排序
	cout << "排序后" << endl;
	sort(d1.begin(), d1.end());
	PrintDeque(d1);
	
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<deque>
#include<algorithm>
#include<ctime>
using namespace std;
class Person
{
public:
	Person(string name, int score)
	{
		this->m_Name = name;
		this->m_Score = score;
	}
	string m_Name;
	int m_Score;
};

void CreatPerson(vector<Person>& v)
{
	string nameSeed = "ABCDE";
	for (int i = 0; i < 5; i++)
	{
		string name = "选手";
		name += nameSeed[i];
		
		int score = 0;
		Person p(name, score);

		v.push_back(p);
	}
}

void setScroe(vector<Person>& v)
{
	for (vector<Person>::iterator it = v.begin(); it != v.end(); it++)
	{
		//将评委的分数放入到deque容器中
		deque<int>d;
		for (int i = 0; i < 10; i++)
		{
			int score = rand() % 41 + 60;
			d.push_back(score);
		}

		/*cout << "选手:" << it->m_Name << "的分数是" << it->m_Score << endl;
		for (deque<int>::iterator dit = d.begin(); dit != d.end(); dit++)
		{
			cout << *dit << " ";
		}
		cout << endl;*/

		//排序
		sort(d.begin(), d.end());

		//去除最低分和最高分
		d.pop_front();
		d.pop_back();

		//取平均分
		int sum = 0;
		for (deque<int>::iterator dit = d.begin(); dit != d.end(); dit++)
		{
			sum += *dit;
		}

		int avg = sum / d.size();
		
		it->m_Score = avg;
	}


}

void showScore(vector<Person>& v)
{
	for (vector<Person>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << "姓名:" << it->m_Name << "得分:" << it->m_Score << endl;
	}
}
int main(void)
{
	//随机数种子
	srand((unsigned int)time(NULL));


	//创建5名选手
	vector<Person>v;
	CreatPerson(v);
	
	//测试
	/*for (vector<Person>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << (*it).m_Name << " " << (*it).m_Score << endl;
	}*/

	//给5名选手打分
	setScroe(v);
	//显示最后的得分
	showScore(v);
	system("pause");
	return 0;
}

#include<iostream>
#include<stack>
using namespace std;
void test01()
{
	stack<int>s;
	//入栈
	s.push(1);
	s.push(2);
	s.push(3);
	s.push(4);
	cout << "栈的大小:" << s.size() << endl;
	//只要栈不为空，就查看栈顶，并且执行出栈操作
	while (!s.empty())
	{
		cout << s.top() << endl;
		s.pop();
	}
	cout << "栈的大小:" << s.size()<< endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<queue>
#include<string>
using namespace std;
class Person
{
public:
	Person(string name, int age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}
	string m_Name;
	int m_Age;
};
void test01()
{
	queue<Person>q;

	Person p1("s1", 1);
	Person p2("s2", 2);
	Person p3("s3", 3);
	Person p4("s4", 4);

	q.push(p1);
	q.push(p2);
	q.push(p3);
	q.push(p4);
	cout << "大小=" << q.size() << endl;
	while (!q.empty())
	{
		cout << q.front().m_Name <<" " << q.front().m_Age << endl;
		q.pop();
	}
	cout << "大小=" << q.size() << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#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>l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	PrintList(l1);

	list<int>l2(l1.begin(), l1.end());
	PrintList(l2);


	list<int>l3(l2);
	PrintList(l3);
	
	list<int>l4(10, 100);
	PrintList(l4);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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

	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	PrintList(l1);

	list<int>l2;
	l2 = l1;//operator=
	PrintList(l2);

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

	list<int>l4;
	l4.assign(10, 100);
	PrintList(l4);

}
void test02()
{
	list<int>l5;

	l5.push_back(1);
	l5.push_back(2);
	l5.push_back(3);
	l5.push_back(4);

	list<int>l6;
	l6.push_back(4);
	l6.push_back(3);
	l6.push_back(2);
	l6.push_back(1);
	cout << "交换前" << endl;
	PrintList(l5);
	PrintList(l6);

	l5.swap(l6);
	cout << "交换后" << endl;
	PrintList(l5);
	PrintList(l6);
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#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>l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	
	PrintList(l1);

	if (l1.empty())
	{
		cout << "空" << endl;
	}
	else
	{
		cout << "不空" << endl;
		cout << "元素个数=" << l1.size()<<endl;
	}
	
	//重新指定大小
	l1.resize(10, 1000);
	PrintList(l1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#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>l1;
	//尾
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	//头
	l1.push_front(10);
	l1.push_front(20);

	PrintList(l1);

	//删
	l1.pop_back();
	PrintList(l1);

	l1.pop_front();
	PrintList(l1);

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

	//删除
	//用的时候指定it
	it = l1.begin();
	l1.erase(++it);
	PrintList(l1);

	//移除
	l1.push_back(1000);
	l1.push_back(1000);
	l1.push_back(1000);
	PrintList(l1);
	l1.remove(1000);//删除所有匹配的元素

	PrintList(l1);


	//清空
	l1.clear();
	PrintList(l1);
}

int main(void)
{
	test01();
	system("pause");
	return 0;
}

#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>l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);

	//list中不可以用[]访问容器中的元素
	//at()也不行
	//因为List本质是链表，不是用连续的线性空间存储数据，迭代器也是不支持随机访问的

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

	//验证迭代器是不支持随机访问的
	list<int>::iterator it = l1.begin();
	it++;//支持++ --  双向
	it--;
	//it = it+1;不行——不支持随机访问

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<list>
#include<algorithm>
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>l1;
	l1.push_back(1);
	l1.push_back(2);
	l1.push_back(3);
	l1.push_back(4);
	
	cout << "反转前" << endl;
	PrintList(l1);

	//反转
	cout << "反转后" << endl;
	l1.reverse();
	PrintList(l1);
}

bool myCompare(int v1, int v2)
{
	//降序 第一个数>第二个数
	return v1 > v2;
}

//排序
void test02()
{
	list<int>l2;
	l2.push_back(20);
	l2.push_back(10);
	l2.push_back(50);
	l2.push_back(30);
	l2.push_back(40);
	cout << "排序前" << endl;
	PrintList(l2);

	//所有不支持随机访问迭代器的容器不可以用标准算法
	//不支持随机访问迭代器的容器，内部会提供对应的一些算法

	cout << "排序后" << endl;
	l2.sort();
	PrintList(l2);

	l2.sort(myCompare);//降序
	PrintList(l2);
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<list>
#include<string>
using namespace std;
class Person
{
public:
	Person(string name, int age, int height)
	{
		this->m_Age = age;
		this->m_Height = height;
		this->m_Name = name;
	}
	string m_Name;
	int m_Age;
	int m_Height;
};
//指定排序规则
bool comparePerson(Person &p1,Person &p2)
{
	//按照年龄升序
	if (p1.m_Age == p2.m_Age)
	{
		//年龄相同 按照身高降序
		return p1.m_Height > p2.m_Height;
	}
	else
	{
		return p1.m_Age < p2.m_Age;
	}
	
}


void test01()
{
	list<Person>L;
	Person p1("s11",23,166);
	Person p2("s12",23,156);
	Person p3("s13",23,178);
	Person p4("s14",33,172);
	Person p5("s15",43,190);
	Person p6("s16",45,175);

	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;

	L.sort(comparePerson);
	for (list<Person>::iterator it = L.begin(); it != L.end(); it++)
	{
		cout << it->m_Name << " " << it->m_Age << " " << it->m_Height << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;

void PrintSet(set<int> &s)
{
	for (set<int>::iterator it = s.begin(); it != s.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}

void test01()
{
	set<int>s1;
	//只有insert,自动排序，不能插入重复数据
	s1.insert(30);
	s1.insert(20);
	s1.insert(10);
	s1.insert(40);

	PrintSet(s1);

	set<int>s2(s1);

	PrintSet(s2);

	set<int>s3;
	s3 = s2;
	PrintSet(s3);

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;

void PrintSet(set<int> &s)
{
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
{
	cout << *it << " ";
}
cout << endl;
}

void test01()
{
	set<int>s1;
	s1.insert(10);
	s1.insert(20);
	s1.insert(30);
	s1.insert(40);

	PrintSet(s1);
	
	if (s1.empty())
	{
		cout << "空" << endl;
	}
	else
	{
		cout << "不空" << endl;
		cout << "大小:" << s1.size() << endl;
	}
	
}

void test02()
{
	set<int>s2;
	set<int>s3;

	s2.insert(100);
	s2.insert(200);
	s2.insert(300);

	s3.insert(1);
	s3.insert(2);
	s3.insert(3);


	
	cout << "交换前:" << endl;
	PrintSet(s2);
	PrintSet(s3);
	s2.swap(s3);
	cout << "交换后:" << endl;

	PrintSet(s2);
	PrintSet(s3);
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;

void PrintSet(set<int> &s)
{
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
{
	cout << *it << " ";
}
cout << endl;
}
void test01()
{
	set<int>s1;
	
	s1.insert(2);
	s1.insert(1);
	s1.insert(3);
	s1.insert(4);

	PrintSet(s1);

	s1.erase(s1.begin());
	PrintSet(s1);

	s1.erase(3);
	PrintSet(s1);
	
	s1.erase(s1.begin(), s1.end());
	PrintSet(s1);

	s1.clear();
	PrintSet(s1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;

void PrintSet(set<int> &s)
{
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
{
	cout << *it << " ";
}
cout << endl;
}
void test01()
{
	set<int>s1;
	s1.insert(1);
	s1.insert(2);
	s1.insert(3);
	s1.insert(4);

	set<int>::iterator pos = s1.find(3);

	if (pos != s1.end())
	{
		cout << "找到" << *pos << endl;
	}
	else
	{
		cout << "没找到" << endl;
	}

	int num = s1.count(3);
	//对于set而言 统计结果 0 或 1，因为无重复
	cout << num << "个" << endl;
}


int main(void)
{
	test01();

	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;


void PrintMultiSet(multiset<int>& ms)
{
	for (multiset<int>::iterator it = ms.begin(); it != ms.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	set<int>s1;
	pair<set<int>::iterator,bool>ret = s1.insert(10);
	
	if (ret.second)
	{
		cout << "插入成功" << endl;
	}
	else
	{
		cout << "插入失败" << endl;
	}

	//第二次
	ret = s1.insert(10);

	if (ret.second)
	{
		cout << "插入成功" << endl;
	}
	else
	{
		cout << "插入失败" << endl;
	}

	multiset<int>ms;

	ms.insert(10);
	ms.insert(10);

	PrintMultiSet(ms);

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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


void test01()
{
	//第一种
	pair<string, int>p("Tom", 11);
	cout << p.first <<" "<< p.second << endl;

	//第二种
	pair<string, int>p2 = make_pair("Jerry", 12);
	cout << p2.first << " " << p2.second << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<set>
using namespace std;


class MyCompare
{
public:
	//vs2019结尾加const
	bool operator()(int v1,int v2)const
	{
		return v1 > v2; 
	}
};

void test01()
{
	set<int,MyCompare>s1;

	//set容器要在还没插数据之前对排序进行改变


	s1.insert(10);
	s1.insert(20);
	s1.insert(30);
	s1.insert(40);

	for (set<int,MyCompare>::iterator it = s1.begin(); it != s1.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

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



class Person
{
public:

	Person(string name, int age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	string m_Name;
	int m_Age;
};


class Mycompare
{
public:
	bool operator()(const Person& p1, const Person& p2)const
	{
		return p1.m_Age > p2.m_Age;
	}
};


void test01()
{
	set<Person, Mycompare>s1;
	Person p1("s1",11);
	Person p2("s2",22);
	Person p3("s3",33);
	Person p4("s4",44);

	s1.insert(p1);
	s1.insert(p2);
	s1.insert(p3);
	s1.insert(p4);
	for (set<Person, Mycompare>::iterator it = s1.begin(); it != s1.end(); it++)
	{
		cout << it->m_Name << " " << it->m_Age << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
using namespace std;

void PrintMap(map<int, int>& m)
{
	for (map<int, int>::iterator it = m.begin(); it != m.end(); it++)
	{
		cout << "key=" << (*it).first << "value=" << (*it).second << "   " ;
	}
	cout << endl;
}

void test01()
{
	map<int, int>m1;
	m1.insert(pair<int, int>(1, 10));
	m1.insert(pair<int, int>(2, 20));
	m1.insert(pair<int, int>(3, 30));
	m1.insert(pair<int, int>(4, 40));

	PrintMap(m1);

	map<int, int>m2(m1);
	PrintMap(m1);

	map<int, int>m3;
	m3 = m2;
	PrintMap(m3);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
using namespace std;

void PrintMap(map<int, int>& m)
{
	for (map<int, int>::iterator it = m.begin(); it != m.end(); it++)
	{
		cout << "key=" << (*it).first << "value=" << (*it).second << "   " ;
	}
	cout << endl;
}

void test01()
{


	map<int, int>m1;
	m1.insert(pair<int, int>(1, 10));
	m1.insert(pair<int, int>(2, 20));
	m1.insert(pair<int, int>(3, 30));
	m1.insert(pair<int, int>(4, 40));

	PrintMap(m1);

	if (m1.empty())
	{
		cout << "空" << endl;
	}
	else
	{
		cout << "不空" << endl;
		cout << "大小=" << m1.size() << endl;
	}


	map<int, int>m2;
	m2.insert(pair<int, int>(10, 1));
	m2.insert(pair<int, int>(20, 2));
	m2.insert(pair<int, int>(30, 3));
	m2.insert(pair<int, int>(40, 4));

	cout << "交换前" << endl;
	PrintMap(m1);
	PrintMap(m2);

	cout << "交换后" << endl;

	m1.swap(m2);
	PrintMap(m1);
	PrintMap(m2);

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
using namespace std;

void PrintMap(map<int, int>& m)
{
	for (map<int, int>::iterator it = m.begin(); it != m.end(); it++)
	{
		cout << "key=" << it->first << " " << "value=" << it->second << endl;
	}
	cout << endl;
}
void test01()
{
	map<int, int>m1;
	//第一种
	m1.insert(pair<int, int>(1, 10));
	//第二种
	m1.insert(make_pair(2, 20));
	//第三种
	m1.insert(map<int, int>::value_type(3, 30));
	//第四种
	m1[4] = 40;//不建议这种，用途是利用key访问到value,不存在会自动创建，所以应该确定存在再访问
	cout << m1[4] << endl;

	PrintMap(m1);

	m1.erase(m1.begin());
	PrintMap(m1);
	
	m1.erase(3);//按照key删除
	PrintMap(m1);

	m1.erase(m1.begin(), m1.end());
	PrintMap(m1);

	m1.clear();
	PrintMap(m1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
using namespace std;

void PrintMap(map<int, int>& m)
{
	for (map<int, int>::iterator it = m.begin(); it != m.end(); it++)
	{
		cout << "key=" << it->first << " " << "value=" << it->second << endl;
	}
	cout << endl;
}
void test01()
{
	map<int, int>m1;

	m1.insert(pair<int, int>(1, 10));
	m1.insert(pair<int, int>(2, 20));
	m1.insert(pair<int, int>(3, 30));

	map<int, int>::iterator pos = m1.find(3);//返回迭代器

	if (pos != m1.end())
	{
		cout << "找到了" <<pos->first<<" "<<pos->second<< endl;
	}
	else
	{
		cout << "没找到" << endl;
	}

	//map不允许插入重复key,0 or 1
	//multimap可以大于1，可以重复
	int num = m1.count(3);
	cout << num << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
using namespace std;



class MyCompare
{
public:
	bool operator()(int v1,int v2)const 
	{
		return v1 > v2;
	}
};

void PrintMap(map<int, int, MyCompare>& m)
{
	for (map<int, int, MyCompare>::iterator it = m.begin(); it != m.end(); it++)
	{
		cout << "key=" << it->first << " " << "value=" << it->second << endl;
	}
	cout << endl;
}
void test01()
{
	map<int, int,MyCompare>m1;
	m1.insert(make_pair(1, 10));
	m1.insert(make_pair(2, 20));
	m1.insert(make_pair(3, 30));
	m1.insert(make_pair(4, 40));
	m1.insert(make_pair(5, 50));

	PrintMap(m1);
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<map>
#include<vector>
#include<string>
#include<ctime>
using namespace std;


#define CEHUA 0
#define MEISHU 1
#define YANFA 2

class Worker
{
public:
	string m_Name;
	int m_Salary;
};
void CreatWorker(vector<Worker> &v)
{
	string NameSeed = "ABCDEFGHIJ";
	for (int i = 0; i < 10; i++)
	{
		Worker worker;
		worker.m_Name = "员工";
		worker.m_Name += NameSeed[i];

		worker.m_Salary = rand() % 10000 + 10000;

		//将员工放到容器中
		v.push_back(worker);
	}
}

//分组
void SetGroup(vector<Worker>& v, multimap<int, Worker>& m)
{
	for (vector<Worker>::iterator it = v.begin(); it != v.end(); it++)
	{
		//产生随机编号
		int deptId = rand() % 3;//0 1 2
		//key部门编号，valuse具体员工
		m.insert(make_pair(deptId, *it));
	}
}

//分组显示
void ShowWorkerByGroup(multimap<int,Worker> &m)
{
	cout << "策划部门:" << endl;
	multimap<int,Worker>::iterator pos = m.find(CEHUA);
	int count = m.count(CEHUA);
	int index = 0;
	for (; pos != m.end() && index < count ; pos++,index++)
	{
		cout << "姓名:" << pos->second.m_Name << "  工资:" << pos->second.m_Salary << endl;
	}

	cout << "美术部门:" << endl;
	pos = m.find(MEISHU);
	count = m.count(MEISHU);
	index = 0;
	for (; pos != m.end() && index < count; pos++, index++)
	{
		cout << "姓名:" << pos->second.m_Name << "  工资:" << pos->second.m_Salary << endl;
	}

	cout << "研发部门:" << endl;
	pos = m.find(YANFA);
	count = m.count(YANFA);
	index = 0;
	for (; pos != m.end() && index < count; pos++, index++)
	{
		cout << "姓名:" << pos->second.m_Name << "  工资:" << pos->second.m_Salary << endl;
	}

}
int main(void)
{
	srand((unsigned int)time(NULL));

	//创建员工
	vector<Worker>vWorker;
	CreatWorker(vWorker);

	//测试
	//for (vector<Worker>::iterator it = vWorker.begin(); it != vWorker.end(); it++)
	//{
	//	cout << "姓名:" << it->m_Name << " " << "工资" << it->m_Salary << endl;
	//}

	//分组
	multimap<int, Worker>mWorker;
	SetGroup(vWorker, mWorker);

	//分组显示员工
	ShowWorkerByGroup(mWorker);

	system("pause");
	return 0;
}

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

class MyAdd
{
public:
	int operator()(int v1, int v2)
	{
		return v1 + v2;
	}
};

void test01()
{
	MyAdd myadd;
	cout << myadd(10, 10) << endl;
}

class MyPrint
{
public:
	MyPrint()
	{
		this->count = 0;
	}
	void operator()(string test)
	{
		cout << test << endl; 
		this->count++;
	}

	int count;//内部自己状态
};
void test02()
{
	MyPrint myprint;
	myprint("hello world");
	myprint("hello world");
	myprint("hello world");
	myprint("hello world");
	myprint("hello world");
	myprint("hello world");

	cout << "MyPrint调用次数为:" << myprint.count << endl;


}

void doPrint(MyPrint& mp, string test)
{
	mp(test);
}

void test03()
{
	MyPrint myPrint;
	doPrint(myPrint, "hello c++");
}
int main(void)
{
	test01();
	test02();
	test03();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;


class CreaterFive
{
public:
	bool operator()(int val)
	{
		return val > 5;
	}
};

void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}

	//查找容器中，有没有大于5的数字
	//CreaterFive()匿名函数对象
	vector<int>::iterator pos = find_if(v.begin(), v.end(), CreaterFive());

	if (pos == v.end())
	{
		cout << "未找到" << endl;
	}
	else
	{
		cout << "找到了，大于5的数字为:" << *pos << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
class MyCompare
{
public:
	bool operator()(int val1,int val2)
	{
		return val1 > val2;
	}
};

void test01()
{
	vector<int>v;

	v.push_back(10);
	v.push_back(40);
	v.push_back(20);
	v.push_back(30);
	v.push_back(50);
	
	sort(v.begin(), v.end());
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;

	//改变为降序
	sort(v.begin(), v.end(),MyCompare());
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>//内建函数对象头文件
using namespace std;

//megate一元仿函数 取反仿函数
void test01()
{
	negate<int>n;
	cout << n(50) << endl;
}

void test02()
{
	//加法仿函数——其他算数仿函数同理
	plus<int>p;//默认认定传的是同种数据类型
	cout << p(10, 20) << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

class MyCompare
{
public:
	bool operator()(int v1,int v2)
	{
		return v1 > v2;
	}
};

void test01()
{
	vector<int>v;
	v.push_back(1);
	v.push_back(3);
	v.push_back(4);
	v.push_back(2);
	v.push_back(5);

	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;

	//sort(v.begin(),v.end(), MyCompare());
	//greater<int>() 内建函数对象
	sort(v.begin(),v.end(), greater<int>());
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

void test01()
{
	vector<bool>v;
	v.push_back(true);
	v.push_back(false);
	v.push_back(true);
	v.push_back(false);

	for (vector<bool>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;

	//利用逻辑非 将容器v 搬运到容器v2中，并执行取反操作

	vector<bool>v2;
	v2.resize(v.size());

	transform(v.begin(), v.end(), v2.begin(),logical_not<bool>());//()代表对象的创建

	for (vector<bool>::iterator it = v2.begin(); it != v2.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

//普通函数
void Print01(int val)
{
	cout << val<<" ";
}
//仿函数
class Print02
{
public:
	void operator()(int val)
	{
		cout << val << " ";
	}
};
void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	for_each(v.begin(), v.end(),Print01);
	cout << endl;
	for_each(v.begin(), v.end(), Print02());
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;


class TransForm
{
public:
	int operator()(int val)
	{
		return val + 100;
	}
};

class MyPrint
{
public:
	void operator()(int val)
	{
		cout << val << " ";
	}
};

void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	vector<int>vTarget;//目标容器
	vTarget.resize(v.size());//目标容器需要提前开辟空间
	transform(v.begin(), v.end(), vTarget.begin(), TransForm());
	for_each(vTarget.begin(), vTarget.end(), MyPrint());
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
using namespace std;

class Person
{
public:
	Person(string name,int age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	//重载==
	bool operator ==(const Person& p)
	{
		if (this->m_Age == p.m_Age && this->m_Name == p.m_Name)
		{
			return true;
		}
		else
		{
			return false;
		}
	}
	string m_Name;
	string m_Age;
};



//内置
void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}

	vector<int>::iterator it = find(v.begin(), v.end(), 5);
	if (it == v.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "找到" << *it << endl;
	}
}
//自定义数据类型
void test02()
{
	vector<Person>V;
	Person p1("1",11);
	Person p2("2",22);
	Person p3("3",33);
	Person p4("4",44);
	
	V.push_back(p1);
	V.push_back(p2);
	V.push_back(p3);
	V.push_back(p4);

	vector<Person>::iterator it = find(V.begin(), V.end(), p2);
	if (it == V.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "找到" << it->m_Name << " " << it->m_Age << endl;
	}
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
using namespace std;


class GreaterFive
{
public:
	bool operator()(int val)
	{
		return val > 5;
	}
};

//内置数据类型
void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	vector<int>::iterator it = find_if(v.begin(), v.end(), GreaterFive());
	if (it == v.end())
	{
		cout << "没找到" << endl;	
	}
	else
	{
		cout << "找到了" << *it << endl;
	}
}

//自定义数据类型

class Person
{
public:
	Person(string name,int age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	string m_Name;
	int m_Age;
};
class Greater20
{
public:
	bool operator()(Person &p)
	{
		return p.m_Age > 20;
	}
};
void test02()
{
	vector<Person>V;
	Person p1("1",11);
	Person p2("2",22);
	Person p3("3",33);
	Person p4("4",44);

	V.push_back(p1);
	V.push_back(p2);
	V.push_back(p3);
	V.push_back(p4);

	vector<Person>::iterator it = find_if(V.begin(), V.end(), Greater20());
	if (it == V.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "找到了" << it->m_Name<<" "<<it->m_Age << endl;
	}
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;


void test01()
{
	vector<int>v;
	v.push_back(0);
	v.push_back(2);
	v.push_back(1);
	v.push_back(2);
	v.push_back(7);
	v.push_back(3);
	v.push_back(3);

	vector<int>::iterator it = adjacent_find(v.begin(), v.end());
	if (it == v.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "找到相邻重复元素" << *it << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;


void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}

	//这个容器必须是有序的序列，如果是无序的序列，结果未知
	bool ret = 	binary_search(v.begin(), v.end(),9);

	if (ret)
	{
		cout << "找到了" << endl;
	}
	else
	{
		cout << "没找到" << endl;
	}
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
using namespace std;


//内置
void test01()
{
	vector<int>v;
	v.push_back(10);
	v.push_back(10);
	v.push_back(40);
	v.push_back(20);
	v.push_back(30);

	int num = count(v.begin(), v.end(), 10);
	cout << num << endl;
}
class Person
{
public:
	Person(string name, int age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	bool operator==(const Person& p)
	{
		if (this->m_Age == p.m_Age)
		{
			return true;
		}
		else
		{
			return false;
		}
	}
	string m_Name;
	int m_Age;
};

void test02()
{
	vector<Person>v;
	Person p1("s1",11 );
	Person p2("s2",12 );
	Person p3("s3",13 );
	Person p4("s4",14 );
	Person p5("s5",14 );
	
	v.push_back(p1);
	v.push_back(p2);
	v.push_back(p3);
	v.push_back(p4);
	v.push_back(p5);
	
	int num = count(v.begin(), v.end(), p5);

	cout << num << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

class Greater20
{
public:
	bool operator()(int val)
	{
		return val > 20;
	}
};
void test01()
{
	vector<int>v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(40);
	v.push_back(30);
	v.push_back(50);

	int num = count_if(v.begin(), v.end(), Greater20());
	cout << num << endl;
}

class Person
{
public:
	Person(string name, int age)
	{
		this->m_Age = age;
		this->m_Name = name;
	}
	string m_Name;
	int m_Age;
};


class AgeGreater20
{
public:
	bool operator()(const Person& p)
	{
		return p.m_Age > 20;
	}

};
void test02()
{
	vector<Person>v;
	Person p1("s1",11 );
	Person p2("s2",22 );
	Person p3("s3",33 );
	Person p4("s4",44 );

	v.push_back(p1); 
	v.push_back(p2); 
	v.push_back(p3); 
	v.push_back(p4); 

	int num = count_if(v.begin(), v.end(),AgeGreater20());
	cout << num << endl;
}
int main(void)
{
	test01();
	test02();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;


void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	v.push_back(20);
	v.push_back(10);
	v.push_back(60);
	v.push_back(5);
	v.push_back(30);
	v.push_back(2);

	//升
	sort(v.begin(), v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

	//降
	sort(v.begin(), v.end(), greater<int>());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<ctime>
using namespace std;

void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
	}
	for_each(v.begin(), v.end(),myPrint);
	cout << endl;

	random_shuffle(v.begin(), v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

}
int main(void)
{
	srand((unsigned int)time(NULL));
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0; i < 5; i++)
	{
		v1.push_back(i);
		v2.push_back(i+5);
	}
	//目标容器
	vector<int>vTarget;
	vTarget.resize(v1.size() + v2.size());

	merge(v1.begin(),v1.end(),v2.begin(),v2.end(),vTarget.begin());

	for_each(vTarget.begin(), vTarget.end(), myPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;


void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	v.push_back(20);
	v.push_back(10);
	v.push_back(60);
	v.push_back(5);
	v.push_back(30);
	v.push_back(2);

	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

	reverse(v.begin(), v.end());
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v1;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
	}

	vector<int>v2;
	v2.resize(v1.size());
	copy(v1.begin(), v1.end(), v2.begin());

	for_each(v2.begin(), v2.end(), myPrint);
	cout << endl;

}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

void myPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	v.push_back(20);
	v.push_back(10);
	v.push_back(60);
	v.push_back(50);
	v.push_back(30);
	v.push_back(20);

	cout << "替换前" << endl;
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;

	cout << "替换后" << endl;
	replace(v.begin(), v.end(), 20, 2000);
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;


}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

void myPrint(int val)
{
	cout << val << " ";
}
class Great30
{
public:
	bool operator()(int val)
	{
		return val > 30;
	}
};
void test01()
{
	vector<int>v;
	v.push_back(20);
	v.push_back(10);
	v.push_back(60);
	v.push_back(50);
	v.push_back(30);
	v.push_back(20);

	cout << "替换前" << endl;
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
	cout << "替换后" << endl;
	replace_if(v.begin(), v.end(),Great30(),3000);
	for_each(v.begin(), v.end(), myPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<algorithm>
#include<string>
#include<functional>
#include<vector>
using namespace std;
void MyPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
		v2.push_back(i+100);
	}

	cout << "交换前" << endl;
	for_each(v1.begin(), v1.end(), MyPrint);
	cout << endl;

	for_each(v2.begin(), v2.end(), MyPrint);
	cout << endl;

	cout << "交换后" << endl;
	swap(v1, v2);

	for_each(v1.begin(), v1.end(), MyPrint);
	cout << endl;

	for_each(v2.begin(), v2.end(), MyPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
void MyPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	for (int i = 0; i <= 100; i++)
	{
		v.push_back(i);
	}
	//参数3是起始累加值
	int total = accumulate(v.begin(), v.end(), 0);
	cout << total << endl;
	
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<algorithm>
#include<numeric>
#include<vector>
#include<algorithm>

using namespace std;
void MyPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v;
	v.resize(10);
    //后期重新填充
	fill(v.begin(),v.end(),100);
	for_each(v.begin(), v.end(), MyPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<algorithm>
#include<string>
#include<functional>
#include<vector>
#include<algorithm>
using namespace std;
void MyPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
		v2.push_back(i+5);
	}
	vector<int>vTarget;
	//最特殊情况，大容器包含小容器，开辟空间 取消的容器的size即可
	vTarget.resize(min(v1.size(),v2.size()));

	//返回迭代器的位置是交集的末尾位置，帮助下面for_each划定区间
	vector<int>::iterator itEnd = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
	
	for_each(vTarget.begin(), itEnd, MyPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
void MyPrint(int val)
{
	cout << val << " ";
}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
		v2.push_back(i+5);
	}
	vector<int>vTarget;
	vTarget.resize(v1.size() + v2.size());
	vector<int>::iterator itEnd = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
	for_each(vTarget.begin(), itEnd, MyPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

void MyPrint(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0; i < 10; i++)
	{
		v1.push_back(i);
		v2.push_back(i+5);
	}
	//考虑特殊情况

	vector<int>vTarget;
	//最特殊情况 两个容器没有交集 取两个容器大的size作为目标容器开辟的空间
	vTarget.resize(max(v1.size(), v2.size()));

	cout << "v1和v2的差集" << endl;


	vector<int>::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
	
	for_each(vTarget.begin(),itEnd, MyPrint);
	cout << endl;

	cout << "v2和v1的差集" << endl;

	itEnd = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), vTarget.begin());

	for_each(vTarget.begin(), itEnd, MyPrint);
	cout << endl;
}
int main(void)
{
	test01();
	system("pause");
	return 0;
}