【STL之set】set集合的使用

set集合的使用

#include <iostream>
#include <set>
#include <string>
#include <utility>
using namespace std;
int main() {
	int N;
	cin >> N;
	set<int> s;
	int K;
	for (int i = 0; i < N; i++) { cin >> K; s.insert(K); }
	set<int>::iterator iter;	//set集合实现自动排序 相同元素只可插入一次
	cout << "After sorting: ";
	for (iter = s.begin(); iter != s.end(); iter++) cout << *iter << ' ';
	cout << endl << s.size() << endl;	//集合元素数量
	//s.clear();	//清空集合元素
	if (!s.empty()) cout << "There exist somgthing." << endl;	//检查集合是否为空
	if (s.count(3)) cout << "There exists 3." << endl;	//查找某一元素是否存在
	pair<set<int>::iterator, set<int>::iterator> pr;
	pr = s.equal_range(3);	//返回值是一个pair类型 分别表示第一个大于或等于给定关键值的元素和第一个大于给定关键值的元素 如果有一个返回失败，就会指向end()
	if (pr.first != s.end() && pr.second != s.end()) {
		cout << "The first number that is bigger than 3 or equal to 3: " << *pr.first << endl
			 << "The first number that is bigger than 3: " << *pr.second << endl;
	}
	s.erase(s.begin());	//通过迭代器删除
	s.erase(3);	//通过实值删除	注意set中的删除操作是不进行任何的错误检查的
	cout << "After erasing: ";
	for (iter = s.begin(); iter != s.end(); iter++) cout << *iter << ' ';
	int Add[] = { 1,2,3 };
	s.insert(Add, Add + 3);
	cout << endl;
	cout << "After inserting: ";
	for (iter = s.begin(); iter != s.end(); iter++) cout << *iter << ' ';
	if (s.find(1) != s.end()) cout << endl << "There exists 1." << endl;
	pair<set<int>::iterator, bool> pr2;
	pr2 = s.insert(5);	//first指向插入位置或存在位置 second表明是否插入成功
	if (pr2.second) cout << "Insert done." << endl;
	else cout << "There alrealy exist 5." << endl;
	cout << "Some of these values exist by default: " << endl;
	cout << "The first number that is bigger than 5 or equal to 5: " << *s.lower_bound(5) << endl;
	cout << "The first number that is bigger than 5: " << *s.upper_bound(5) << endl;
	return 0;
}