（3）C++容器---list

list---鏈表，不連續的內存存儲數據，隨即存取效率低，不支持[]直接訪問操作

#include <iostream>
#include <thread>
#include <windows.h>
#include <queue>
#include <string>
#include <list>

void printList(std::list<int> &list)
{
	std::list<int>::iterator itor;
	for (itor = list.begin(); itor != list.end(); ++itor)
	{
		std::cout << *itor << std::endl;

	}
}

int main()
{
	std::list<int> l = { 1,2,3,4,5,6,7,8,9 };

	printList(l);
	l.push_back(55);
	l.push_front(66);
	printList(l);
	int data = 0;
	data = l.back();
	std::cout << data << std::endl;

	data = l.front();
	std::cout << data << std::endl;

	l.emplace(l.begin(), 77);
	std::list<int>::iterator it = l.begin();
	for (int i = 0; i < 4; i++)
	{
		it++;
	}
	l.insert(it, 88);

	l.erase(l.begin(), l.end());

	std::cout << "***********************\n" << std::endl;
	printList(l);
	system("pause");

	return 0;
}