原题:
解决方法:
代码:
Given an array of integers sorted in ascending order, 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]
.
看到时间复杂度是O(log n)就知道需要使用二分查找法。
由于需要查找的是范围,需要两次二分查找。第一次二分查找到不小于target的第一个位置,如果这个位置的值不是目标值,表示不存在这样的数值范围,直接返回-1。如果存在则继续,找到右边第一个不大于target的就是右边界线,要注意的是中间值需要往右边偏1。
代码:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> res(2, -1);
if (nums.empty())
return res;
int n = nums.size(), lo = 0, hi = n -1;
while(lo < hi){
int mid = lo + ( (hi-lo) >> 1 );
if (nums[mid] < target)
lo = mid + 1;
else
hi = mid;
}
if (nums[lo] != target)
return res;
res[0] = lo;
hi = n-1;
while(lo < hi){
int mid = lo + ( (hi-lo) >> 1 ) + 1;
if (nums[mid] > target)
hi = mid - 1;
else
lo = mid;
}
res[1] = hi;
return res;
}