set_rang.cpp-优快云博客

本文链接：https://blog.youkuaiyun.com/CCodes/article/details/1874709

本文通过一个C++示例展示了如何使用STL中的set容器进行元素插入、以及如何利用lower_bound、upper_bound和equal_range等成员函数来查找特定范围内的元素。这些函数对于高效地管理和检索有序集合非常有用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"> #ifdef __BCPLUSPLUS__
#include <set.h>
#else
#include <set>
#endif

#include <iostream.h>

using namespace std;
typedef set<int, less<int>> SET_INT;

void main(void)
{
SET_INT s1;
SET_INT::iterator i;

   s1.insert(5);
   s1.insert(10);
   s1.insert(15);
   s1.insert(20);
   s1.insert(25);
   cout << "s1 -- starting at s1.lower_bound(12)" << endl;

// prints: 15,20,25
   for (i = s1.lower_bound(12); i != s1.end(); i++)
      cout << "s1 has " << *i << " in its set." << endl;
   cout << "s1 -- starting at s1.lower_bound(15)" << endl;

// prints: 15,20,25
   for (i = s1.lower_bound(15);i != s1.end(); i++)
      cout << "s1 has " << *i << " in its set." << endl;
   cout << "s1 -- starting at s1.upper_bound(12)" << endl;

// prints: 15,20,25
   for (i = s1.upper_bound(12); i != s1.end(); i++)
      cout << "s1 has " << *i << " in its set." << endl;
   cout << "s1 -- starting at s1.upper_bound(15)" << endl;

// prints: 20,25
   for (i = s1.upper_bound(15); i != s1.end(); i++)
     cout << "s1 has " << *i << " in its set." << endl;
   cout << "s1 -- s1.equal_range(12)" << endl;

// does not print anything
   for (i = s1.equal_range(12).first;i != s1.equal_range(12).second; i++)
      cout << "s1 has " << *i << " in its set." << endl;
   cout << "s1 -- s1.equal_range(15)" << endl;

// prints: 15
for (i = s1.equal_range(15).first;i != s1.equal_range(15).second; i++)
cout << "s1 has " << *i << " in its set." << endl;
}