Difficulty:medium
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]
.
这道题目其实是利用了Search Insert Position这个题目得解题方法
在求解查找插入位置的问题是,要求的是将元素找出或者找到可以按大小插入的位置,而在这个题目中进行变体,如果target=nums[mid]时不返回,当target>nums[mid]时,left=mid+1;当target<=nums[mid]时,right=mid-1,这样保证了只要target大于nums[mid]就将左边界向右逼近,当target<=nums[mid]时,将右边界向左逼近,直到left=right时,要么nums[mid]=target,使right-1,要么是nums[mid]<target,left+1.这两种情况下无论哪一个都保证了Left就是左边界。
同样的,如果要得到右边界right,也是通过这种方式,所以最终得到了left和right的值,最后进行判断如果left<=right就返回这两个边界值。
代码如下:
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int left,right;
int n=nums.size();
left=0;
right=n-1;
while(left<=right)
{
int mid=(left+right)/2;
if(nums[mid]<target) left=mid+1;
else right=mid-1;
}
int first=left;
left=0;right=n-1;
while(left<=right)
{
int mid=(left+right)/2;
if(nums[mid]>target) right=mid-1;
else left=mid+1;
}
int second=right;
vector<int> ans;
if(first<=second)
{
ans.push_back(first);
ans.push_back(second);
}
else
{
ans.push_back(-1);
ans.push_back(-1);
}
return ans;
}
};