set :: upper_bound()是C++ STL中的内置函数,它返回一个迭代器,该迭代器指向刚好大于k的下一个直接元素。如果在参数中传递的键超过了容器中的最大键,则迭代器返回的点将指向set容器中最后一个元素的下一个(可以使用set end()函数进行标识)。
句法:
set_name.upper_bound(key)
参数:此函数接受单个强制性参数键,该键指定要返回其上限的元素。
返回值:该函数返回一个迭代器,该迭代器指向刚好大于k的紧邻的下一个元素。如果在参数中传递的键超过了容器中的最大键,则迭代器将指向std :: end(),它指向集合中最后一个元素旁边的元素。
示例1:下面的程序说明了上述函数:
// CPP program to demonstrate the
// set::upper_bound() function
#include
using namespace std;
int main()
{
set s;
// Function to insert elements
// in the set container
s.insert(1);
s.insert(4);
s.insert(2);
s.insert(5);
s.insert(6);
cout << "The set elements are: ";
for (auto it = s.begin(); it != s.end(); it++)
cout << *it << " ";
// when 2 is present
// points to next element after 2
auto it = s.upper_bound(2);
cout << "\nThe upper bound of key 2 is ";
cout << (*it) << endl;
// when 3 is not present
// points to next greater after 3
it = s.upper_bound(3);
cout << "The upper bound of key 3 is ";
cout << (*it) << endl;
return 0;
}
输出:
The set elements are: 1 2 4 5 6
The upper bound of key 2 is 4
The upper bound of key 3 is 4
示例2:下面是更好的代码,该代码还检查给定元素是否大于或等于最大元素。
// CPP program to demonstrate the
// set::upper_bound() function
#include
using namespace std;
int main()
{
set s;
// Function to insert elements
// in the set container
s.insert(1);
s.insert(4);
s.insert(2);
s.insert(5);
s.insert(6);
int key = 8;
auto it = s.upper_bound(key);
if (it == s.end())
cout << "The given key is greater "
"than or equal to the largest element \n";
else
cout << "The immediate greater element "
<< "is " << *it << endl;
key = 3;
it = s.upper_bound(key);
if (it == s.end())
cout << "The given key is greater "
"than or equal to the largest element \n";
else
cout << "The immediate greater element "
<< "is " << *it << endl;
return 0;
}
输出:
The given key is greater than or equal to the largest element
The immediate greater element is 4
要从最佳影片策划和实践问题去学习,检查了C++基础课程为基础,以先进的C++和C++ STL课程基础加上STL。要完成从学习语言到DS Algo等的更多准备工作,请参阅“完整面试准备课程” 。