数据结构
网络
RDBMS
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理
化学
生物
数学
英语
经济学
心理学
社会学
时尚学
法律研究在 C++ STL 中设置 lower_bound() 函数
C++ STL 中的 Set lower_bound() 函数返回指向容器中某个元素的迭代器，该元素与参数中的 k 等价。如果 k 不存在于 set 容器中，则该函数返回指向紧接在 k 之后的元素的迭代器。
算法
Begin Initialize an empty set container s. Initializing a set container as inetrator. Insert some elements in s set container. Call function to find the lower bound value of a given key, which is passed to iter set container. Print the lower bound value of the given key. End.
示例代码
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
set<int> s; //Declaring an empty set container
set<int>::iterator iter; //Declaring a set container as iterator which will point to the lower bound value
s.insert(7); //inserting elements in the set container s
s.insert(6);
s.insert(1);
s.insert(4);
s.insert(2);
s.insert(9);
s.insert(10);
iter = s.lower_bound(4); //passing a key by parameter to find its lower bound
cout <<"The lower bound of 4 is: "<< *iter << " "<<endl; //printing the lowerbound value
iter = s.lower_bound(5);
cout <<"The lower bound of 5 is: " <<*iter << " "<<endl;
iter = s.lower_bound(30);
cout <<"The lower bound of 30 is: " <<*iter << " "<<endl;
return 0;
}输出
The lower bound of 4 is: 4 The lower bound of 5 is: 6 The lower bound of 30 is: 7
更新于： 30-Jul-2019
1K+ 浏览
广告