![这里写图片描述](https://img-blog.csdn.net/20171016190149318?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvcXFfMzg3Njc2Njg=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/SouthEast)
这是一道比较常见而且简单的题,对一个增序的数列进行指定数值的查找,返回它的区间。题目要求用log n的时间复杂度,因此我们可以采用分治算法,每次取数组的中间元素,判断它和目标的大小关系,如果相等,则向左和向右移动坐标,取得所求的区间,如果大于目标,说明目标在偏左的一半,进行递归,如果小于,则对偏右的一半进行递归,直到求出结果或者左边的游标大于右边的游标,说明不存在要找的数字。
class Solution {
public:
vector<int> searchByRecursion(vector<int>& nums, int target, int left, int right) {
if (left > right) {
vector<int> result;
result.push_back(-1);
result.push_back(-1);
return result;
}
int index = (left + right) / 2;
if (nums[index] == target) {
int indexLeft = index;
int indexRight = index;
while (nums[indexLeft] == target) {
indexLeft--;
if (indexLeft < left)
break;
}
while (nums[indexRight] == target) {
indexRight++;
if (indexRight > right)
break;
}
vector<int> result;
result.push_back(indexLeft + 1);
result.push_back(indexRight - 1);
return result;
} else {
if (nums[index] > target) {
return searchByRecursion(nums, target, left, index - 1);
} else {
return searchByRecursion(nums, target, index + 1, right);
}
}
}
vector<int> searchRange(vector<int>& nums, int target) {
return searchByRecursion(nums, target, 0, nums.size() - 1);
}
};