求有序数组中处于[left,right]区间的部分

该问题可分解为求数组中第一个不小于left的下标和求数组中最后一个不大于right的下标。

#include <vector>
#include <iostream>

//求数组中第一个不小于left的下标
int FirstNotLower(const std::vector<int>& num, const int left) {
    if (num.empty())
        return -1;
    int len = num.size();
    int low = 0, high = len - 1, mid = (low + high) >> 1;
    //当low和high间有元素时，若中值小于left则在后半部分继续搜索
    while (high - low > 1){
        if (num[mid] < left)
            low = mid;
        else
            high = mid;
        mid = (low + high) >> 1;
    }
    //low和high相邻后，分别与left比较来判断返回值
    //这里包含num元素个数为1或2的情况
    if (num[low] >= left)
        return low;
    else if (num[high] < left)
        return -1;
    else
        return high;
}

//求数组中最后一个不大于right的下标
int LastNotHigher(const std::vector<int>& num, const int right) {
    if (num.empty())
        return -1;
    int len = num.size();
    int low = 0, high = len - 1, mid = (low + high) >> 1;
    //当low和high间有元素时，若中值大于right则在前半部分继续搜索
    while (high- low > 1) {
        if (num[mid] > right)
            high = mid;
        else
            low = mid;
        mid = (low + high) >> 1;
    }
    //low和high相邻后，分别与right比较来判断返回值
    //这里包含num元素个数为1或2的情况
    if (num[high] <= right)
        return high;
    else if (num[low] > right)
        return -1;
    else
        return low;
}

//主问题求解
int GetInterval(const std::vector<int>& num, int left, int right, std::vector<int>& res){
    if (left > right)
        return -1;
    int first_not_lower = FirstNotLower(num, left);
    int last_not_higher = LastNotHigher(num, right);
    if (first_not_lower == -1 || last_not_higher == -1)
        return -2;
    for (int i = first_not_lower; i <= last_not_higher; ++i)
        res.push_back(num[i]);
    return first_not_lower;
}

int main() {
    int a[] = {2,3,4,9,9,9,9,9,9,9,9,9,17,44,78,101,9527};
    //std::vector<int> num(&a[0],&a[17]);
    std::vector<int> num(a,a + sizeof(a) / sizeof(int));
    std::vector<int> res;
    int n = GetInterval(num, 33, 99, res);
    if (n == -1){
        std::cout << "The right number must bigger than or equal to the left number!\n";
    }
    else if (n == -2){
        std::cout << "None elements!\n";
    }
    else{
        int size = res.size(), m = n + size -1;
        std::cout << "num[" << n << "] ~~ num[" << m << "]\n";
        for (int i = 0; i < size; ++i)
            std::cout << res[i] << " ";
        std::cout  << std::endl;
    }

    return 0;
}

注意main函数中的注释行，其结果是将前16个值赋值给vector，别问我是怎么弄的这个奇葩写法！！！( ✘_✘ )↯