题目如下:
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]
.
具体代码如下:
vector<int> searchRange(int A[], int n, int target) {
vector<int> result;
result.push_back(-1);
result.push_back(-1);
if(n<=0)return result;
int l=0,r=n-1,m=l+(r-l)/2;
while(l<r)
{
if(A[m]>=target)r=m;
if(A[m]<target)l=m+1;
m=l+(r-l)/2;
}
if(A[m]==target)
result[0]=m;
else
return result;
l=m;r=n-1;m=l+(r-l)/2+1;
while(l!=r)
{
if(A[m]==target)l=m;
if(A[m]>target)r=m-1;
m=l+(r-l)/2+1;
}
result[1]=l;
return result;
}