set容器的使用詳解

訪問操作:

插入操作:

	set<int> T;


	//***1*** 最普通的插入方式
	T.insert(2);
	T.insert(3);
	T.insert(4);
	T.insert(5);
	T.insert(6);
	//插入元素

	cout << "遍歷T的元素: " << " ";
	set<int>::iterator it1 = T.begin();

	while (it1 != T.end())
	
	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;

	//***2*** 利用陣列集合插入
	set<int> OtherSet;
	int arr[10] = { 1, 2, 3, 4, 5 };
	OtherSet.insert(arr, arr + 3);

	cout << "遍歷OtherSet的元素: " << " ";
	it1 = OtherSet.begin();

	while (it1 != OtherSet.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;

	//***3*** 利用迭代器區間進行插入

	set<int> OtherSet2;

	OtherSet2.insert(T.begin(), T.end());

	cout << "遍歷OtherSet的元素: " << " ";
	it1 = OtherSet2.begin();

	while (it1 != OtherSet2.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;

刪除操作:

	set<int> T;
	int arr[10] = { 1, 2, 3, 4, 6, 7 };

	T.insert(arr, arr + 6);

	cout << "遍歷T的元素: " << " ";
	set<int>::iterator it1 = T.begin();

	while (it1 != T.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;


	//***1***  找到節點迭代器然後刪除節點

	set<int>::iterator it2 = T.find(2);
	//先找到鍵值為2的迭代器，然後刪除該迭代器.

	T.erase(it2);

	cout << "遍歷T的元素: " << " ";
	it1 = T.begin();

	while (it1 != T.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;

	//***2*** 刪除一個迭代器區間
	
	it2 = T.find(3);

	T.erase(it2, T.end());
	//刪除3到set結束這段區間的所有元素.

	cout << "遍歷T的元素: " << " ";
	it1 = T.begin();

	while (it1 != T.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;

	//***3*** 終極大招 clear

	T.clear();

	cout << "遍歷T的元素: " << " ";
	it1 = T.begin();

	while (it1 != T.end())

	{
		cout << *it1 << "  ";
		++it1;
	}
	cout << endl;