传智扫地僧课程学习笔记。
直接贴老师课上示例代码,
//find查找 equal_range
//返回结果是一个pair
void main95()
{
set<int> set1;
for (int i=0; i<10; i++)
{
set1.insert(i+1);
}
//从大 到 小
for (set<int>::iterator it = set1.begin(); it != set1.end(); it++ )
{
cout << *it << " ";
}
cout << endl;
set<int>::iterator it0 = set1.find(5);
cout << "it0:" << *it0 << endl;
int num1 = set1.count(5);
cout << "num1:" << num1 << endl;
set<int>::iterator it1 = set1.lower_bound(5); // 大于等于5的元素 的 迭代器的位置
cout << "it1:" << *it1 << endl;
set<int>::iterator it2 = set1.lower_bound(5); // 大于5的元素 的 迭代器的位置
cout << "it2:" << *it2 << endl;
//
//typedef pair<iterator, bool> _Pairib;
//typedef pair<iterator, iterator> _Pairii;
//typedef pair<const_iterator, const_iterator> _Paircc;
//把5元素删除掉
set1.erase(5);
pair<set<int>::iterator, set<int>::iterator> mypair = set1.equal_range(5);
set<int>::iterator it3 = mypair.first;
cout << "it3:" << *it3 << endl; //5 //6
set<int>::iterator it4 = mypair.second;
cout << "it4:" << *it4 << endl; //6 //6
}