难度:2
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]
.
就是在一列排序号的数里找到某个数出现的区间
我的做法是先二分出区间左端点,再二分出区间右端点
class Solution
{
public:
vector<int> searchRange(int A[], int n, int target)
{
vector<int>ans;
int L=0;
int R=n-1;
//找到开始的位置
while(L<R)
{
int mid=(L+R)>>1;
if(A[mid] < target) L=mid+1;
else if(A[mid] > target) R=mid-1;
else R=mid;
}
if(A[L] == target) ans.push_back(L);
else
{
ans.push_back(-1);
ans.push_back(-1);
return ans;
}
//找到最后的位置
L=0;R=n-1;
while(L<R)
{
int mid=((L+R)>>1)+1;
if(A[mid] < target) L=mid+1;
else if(A[mid] > target) R=mid-1;
else L=mid;
}
if(A[L] == target) ans.push_back(L);
return ans;
}
};