查找数组中第一个大于/大于等于的元素下标

这个问题应该肯定使用二分查找，时间复杂度是O(logn)。比较麻烦的一点在于如何当前这个数是不是第一个大于等于这个数的下标，需要我们用 res 来存放最近的满足条件的那个数，这样left或者right变化就不怕了。也可以直接借助标准库中的 lower_bound 和 upper_bound() ，详细见https://blog.csdn.net/qq_40160605/article/details/80150252

#include<iostream>
#include<vector>
using namespace std;

//查找nums中第一个大于target的数字的下标，没有则返回-1
int search_firstL_index(vector<int> &nums,int target)
{
    int left = 0, right = nums.size() - 1, res = right;
    while(left <= right)
    {
        int mid = left + (right - left) / 2 ;
        if(nums[mid] > target)
        {
            res = mid; right = mid - 1;
        }else
        {
            left = mid + 1;
        }

    }
    if(target<nums[res]) return res;
    return -1;
}
//查找nums中第一个大于等于target的数字的下标，没有则返回-1
int search_firstLE_index(vector<int> &nums,int target)
{
    int left = 0, right = nums.size() - 1, res = right;
    while(left <= right)
    {
        int mid = left + (right - left) / 2 ;
        if(nums[mid] >= target)
        {
            res = mid; right = mid - 1;
        }else
        {
            left = mid + 1;
        }

    }
    if(target<=nums[res]) return res;
    return -1;
}

int main()
{
    vector<int> nums = {1,3,5,7,9,10,18,20,30,50,60,70};
    //测试大于功能
    // cout<<search_firstL_index(nums,-5)<<" ";
    // cout<<search_firstL_index(nums,1)<<" ";
    // cout<<search_firstL_index(nums,7)<<" ";
    // cout<<search_firstL_index(nums,16)<<" ";
    // cout<<search_firstL_index(nums,70)<<" ";
    // cout<<search_firstL_index(nums,90)<<" ";
    // 测试大于等于功能
    // cout<<search_firstLE_index(nums,-9)<<" ";
    // cout<<search_firstLE_index(nums,7)<<" ";
    // cout<<search_firstLE_index(nums,16)<<" ";
    // cout<<search_firstLE_index(nums,60)<<" ";
    // cout<<search_firstLE_index(nums,70)<<" ";
    // cout<<search_firstLE_index(nums,80)<<" ";
    return 0;
}