std函数 lower_bound/upper_bound

函数定义：

template <class ForwardIterator, class T>

    ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);

template <class ForwardIterator, class T, class Compare>

    ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);

返回值：

• Return iterator to lower bound
• Returns an iterator pointing to the first element in the range [first,last) which does not compare less than val.
  返回不小于它的第一个元素的下标

区别：

• 区别与函数upper_bound，upper_bound是返回第一个大于它的元素的下标。

// lower_bound/upper_bound example
#include <iostream>     // std::cout
#include <algorithm>    // std::lower_bound, std::upper_bound, std::sort
#include <vector>       // std::vector

int main () {
  int myints[] = {10,20,30,30,20,10,10,20};
  std::vector<int> v(myints,myints+8);           // 10 20 30 30 20 10 10 20

  std::sort (v.begin(), v.end());                // 10 10 10 20 20 20 30 30

  std::vector<int>::iterator low,up;
  low=std::lower_bound (v.begin(), v.end(), 20); //          ^
  up= std::upper_bound (v.begin(), v.end(), 20); //                   ^

  std::cout << "lower_bound at position " << (low- v.begin()) << '\n';
  std::cout << "upper_bound at position " << (up - v.begin()) << '\n';

  return 0;
}

• Output:
• lower_bound at position 3
• upper_bound at position 6