题目
Given a sorted array of integers, find the starting and ending position of a given target 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]
.
分别二分查找区间头和尾即可,即寻找第一个taret和最后一个target
代码:
class Solution {
public:
vector<int> searchRange(int A[], int n, int target) {
vector<int> ans;
ans.push_back(-1);
ans.push_back(-1);
if(n<1)
return ans;
int first=0,last=n-1,mid;
while(first<last) //查找区间头
{
mid=(first+last)/2;
if(A[mid]>=target)
last=mid;
else
first=mid+1;
}
if(A[first]!=target) //是否存在
return ans;
ans[0]=first;
last=n-1;
while(first<last) //查找区间尾
{
mid=(first+last+1)/2;
if(A[mid]>target)
last=mid-1;
else
first=mid;
}
ans[1]=first;
return ans;
}
};