⭐️STL⭐️之list，set，map全解，❤️算法必备❤️＜下＞

#include<iostream>
#include<list>
using namespace std;
void print(list<int> &l)
{
	for (list<int> ::iterator it = l.begin(); it != l.end(); it++)
	{
		cout << *it<<" ";
	}
	cout << endl;
}
void test01()
{
	list<int> l;
	l.push_back(10);
	l.push_back(20);
	l.push_front(100);
	l.push_front(200);
	if (l.empty())
	{
		cout << "为空";
	}
	else
	{
		cout<<l.size()<<endl;
	}
	print(l);
	//200 100 10 20
	l.pop_back();
	print(l);
	//200 100 10
	l.clear();
}
int main()
{
	test01();
	return 0;
}

#include<iostream>
#include<algorithm>
#include<list>
using namespace std;
void print(list<int> &L)//打印
{
	for (list<int> ::iterator it = L.begin(); it != L.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
bool fanzhuan(int v1,int v2)
{
	return v1 > v2;
}
void test01()
{
	list<int> l1;
	l1.push_back(10);
	l1.push_back(20);
	l1.push_back(30);
	l1.push_back(20);
	l1.push_back(10);
	print(l1);
	l1.reverse();
	print(l1);
	//从小到大排
	l1.sort();
	print(l1);
	//从大到小
	l1.reverse();
	print(l1);
	//换一个方式
	l1.push_front(10);
	l1.sort(fanzhuan);
	print(l1);
	
}
int main()
{
	test01();
	return 0;
}

//set是一个容器，区别是当他刚插入是就已经排好了,集合
#include<set>
#include<iostream>
using namespace std;
void print(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(5);
	s1.insert(1);
	set<int>s2;
	s2.insert(44);
	s2.insert(11);
	s2.insert(55);
	print(s2);
	print(s1);
	//交换
	s1.swap(s2);
	print(s2);
	print(s1);
	cout<<s1.cout(11);
	//应该是1，因为s1和s2互换了序列
	int num=s1.count(10);
	cout<<num<<endl;
	应该为0
	cout << s1.size() << " " << s2.size();

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

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
//仿函数
class compare
{
public:
	bool operator()(int l1,int l2)
	{
		return l1 > l2;
	}
};
void print(set<int> &s)
{
	for (set<int> ::iterator it = s.begin(); it != s.end(); it++)
	{
		cout << *it << " ";
	}
	cout << endl;
}
void test01()
{
	set<int> s;
	s.insert(30);
	s.insert(20);
	s.insert(40);
	s.insert(50);
	s.insert(10);
	print(s);
	//排序
	set<int, compare>s1;
	s1.insert(30);
	s1.insert(20);
	s1.insert(40);
	s1.insert(50);
	s1.insert(10);
	//print(s1);
	for (set<int, compare>::iterator it = s1.begin(); it != s1.end(); it++)
	{
		cout << *it << " ";
	}
}
int main()
{
	test01();
	return 0;
}

#include<iostream>
#include<string>
using namespace std;
void test01()
{
	pair<string, int> p(string("masheng"), 20);
	cout << p.first << " " << p.second << endl;
	pair<string, int>p1("tom", 18);
	cout << p1.first << " " << p1.second << endl;

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

#include<map>
#include<iostream>
using namespace std;
void print(map<int,int> &m1)
{
	for (map<int,int> ::iterator it=m1.begin();it!=m1.end();it++)
	{
		cout << it->first << " " << it->second;
	}
	cout << endl;
}
void test01()
{
	map<int, int> m;
	//用pair传入
	m.insert(pair<int, int>(1, 5));
	m.insert(pair<int, int>(8, 5));
	m.insert(pair<int, int>(3, 5));
	//可以看出根据key值来排序
	map<int, int>m1(m);
	m1 = m;
	print(m);
}
int main()
{
	test01();
	return 0;
}

void test01()
{
	map<int, int>m;
	m[5];
	print(m);
}