multiset :: upper_bound()是C++ STL中的内置函数,该函数返回一个迭代器,该迭代器指向刚好大于k的下一个元素。如果参数中传递的键超过了容器中的最大键,则返回的迭代器将指向一个元素,该元素指向容器中最后一个元素之后的位置。
句法:
multiset_name.upper_bound(key)
参数:此函数接受单个强制性参数键,该键指定要返回其upper_bound的元素。
返回值:该函数返回一个迭代器。
下面的程序说明了上述函数:
程序1:
C++
// C++ program to demonstrate the
// multiset::upper_bound() function
#include
using namespace std;
int main()
{
multiset s;
// Function to insert elements
// in the multiset container
s.insert(1);
s.insert(3);
s.insert(3);
s.insert(5);
s.insert(4);
cout << "The multiset elements are: ";
for (auto it = s.begin(); it != s.end(); it++)
cout << *it << " ";
// when 3 is present
auto it = s.upper_bound(3);
cout << "\nThe upper bound of key 3 is ";
cout << (*it) << endl;
// when 2 is not present
// points to next greater after 2
it = s.upper_bound(2);
cout << "The upper bound of key 2 is ";
cout << (*it) << endl;
// when 10 exceeds the max element in multiset
it = s.upper_bound(10);
cout << "The upper bound of key 10 is ";
cout << (*it) << endl;
return 0;
}
C++
// C++ program to demonstrate the
// multiset::upper_bound() function
#include
using namespace std;
int main()
{
multiset s;
// Function to insert elements
// in the multiset container
s.insert(10);
s.insert(13);
s.insert(13);
s.insert(25);
s.insert(24);
cout << "The multiset elements are: ";
for (auto it = s.begin(); it != s.end(); it++)
cout << *it << " ";
// when 10 is present
auto it = s.upper_bound(10);
cout << "\nThe upper bound of key 10 is ";
cout << (*it) << endl;
// when 2 is not present
// points to next greater after 2
it = s.upper_bound(2);
cout << "The upper bound of key 2 is ";
cout << (*it) << endl;
// when 24 exceeds is the max element
it = s.upper_bound(24);
cout << "The upper bound of key 24 is ";
cout << (*it) << endl;
return 0;
}
输出:
The multiset elements are: 1 3 3 4 5
The upper bound of key 3 is 4
The upper bound of key 2 is 3
The upper bound of key 10 is 5
程式2:
C++
// C++ program to demonstrate the
// multiset::upper_bound() function
#include
using namespace std;
int main()
{
multiset s;
// Function to insert elements
// in the multiset container
s.insert(10);
s.insert(13);
s.insert(13);
s.insert(25);
s.insert(24);
cout << "The multiset elements are: ";
for (auto it = s.begin(); it != s.end(); it++)
cout << *it << " ";
// when 10 is present
auto it = s.upper_bound(10);
cout << "\nThe upper bound of key 10 is ";
cout << (*it) << endl;
// when 2 is not present
// points to next greater after 2
it = s.upper_bound(2);
cout << "The upper bound of key 2 is ";
cout << (*it) << endl;
// when 24 exceeds is the max element
it = s.upper_bound(24);
cout << "The upper bound of key 24 is ";
cout << (*it) << endl;
return 0;
}
输出
The multiset elements are: 10 13 13 24 25
The upper bound of key 10 is 13
The upper bound of key 2 is 10
The upper bound of key 24 is 25
多重设定的所有功能
要从最佳影片策划和实践问题去学习,检查了C++基础课程为基础,以先进的C++和C++ STL课程基础加上STL。要完成从学习语言到DS Algo等的更多准备工作,请参阅“完整面试准备课程” 。