34. Search for a Range
Given an array of integerssorted in ascending order, find the starting and ending position of a giventarget value.
Your algorithm's runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1]
.
For example,
Given [5, 7, 7, 8, 8, 10]
and target value 8,
return [3, 4]
.
这个题目和33题非常地类似,也是可以利用二分法查找,然后找到后就想前后扩张,最后得到结果。
算法思想:
1. 查找当前数组中间位置的值,比较中间位置值和目标值的大小。
2. 若比目标值大,就将中间位置开始到数组末尾当做一个新的数组,跳到第一步,直到找到目标值新的数组元素个数为1。
3. 若比目标值小,就将数组头部到中间位置当做一个新的数组,跳到第一步,直到找到目标值或者新的数组元素个数为1。
int gold = 0;
int result = -1;
vector<int> searchRange(vector<int>& nums, int target) {
int start,end;
int endindex = nums.size()-1;
gold = target;
twopart(nums,0,endindex);
if(result >= 0){
start = result;
while(start > 0){
if(nums[start-1] == target)start--;
else break;
}
end = result;
while(end < endindex){
if(nums[end+1] == target )end++;
else break;
}
return {start,end};
}
else{
return {-1,-1};
}
}
void twopart(vector<int>& nums,int left , int right){
if(left > right)return;
int mid = (right + left) / 2;
if(nums[mid] == gold)result = mid;
else if(nums[mid] > gold)
twopart(nums,left ,mid-1);
else
twopart(nums,mid+1,right);
}