C++ STL中的多集UpPixBoin（）-yiteyi-C++库

这个 多集：：上界（） 在C++ STL中是一个内置函数，它返回一个迭代器指向紧邻k的下一个元素，如果参数中传递的密钥超过容器中的最大密钥，则迭代器返回指向容器中最后一个元素之后的位置的元素。

null

语法：

multiset_name.upper_bound(key)

参数： 此函数接受一个强制参数键，该键指定要返回其上界的元素。

返回值： 该函数返回一个迭代器。

以下程序说明了上述功能：

项目1：

C++

                         // C++ program to demonstrate the                       
                         // multiset::upper_bound() function                       
                         #include <bits/stdc++.h>                       
                         using                                     namespace                                     std;                       
                         int                                     main()                       
                         {                       
           
                                                 multiset<                                     int                                     > 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 <<                                     "The 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;                       
                         }                       

输出：

The multiset elements are: 1 3 3 4 5 The upper bound of key 3 is 4The upper bound of key 2 is 3The upper bound of key 10 is 5

项目2：

C++

                         // C++ program to demonstrate the                       
                         // multiset::upper_bound() function                       
                         #include <bits/stdc++.h>                       
                         using                                     namespace                                     std;                       
                         int                                     main()                       
                         {                       
           
                                                 multiset<                                     int                                     > 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 <<                                     "The 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 13The upper bound of key 2 is 10The upper bound of key 24 is 25

多重集的所有函数

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章