题目描述
Given an array of integers nums 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].
想法
- 用二分法查找,三种情况:
- nums[medium]<target: 则查找范围转到[m+1, e](这里要考虑到m+1会不会过界的问题,如果过界了,则返回[-1,-1])
- target<nums[medium]: 则查找范围减小到[s, m-1](这里不用多比较一步,因为我们向上取整)
- target==nums[medium]:先把返回数组初始化为[medium,medium], 然后比较前后相同的数,如果 nums[medium–]= target, 则re[0]=medium-1;如果nums[medium++] == target 则re[1]=medium+1 直到世界的尽头
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int s=0, e=nums.size()-1;
vector<int> re(2,-1);
while(s<e)
{
int m=(s+e+1)/2;//向上取整
if(nums[m]<target)
if(e<m+1)
return re;
else
s=m+1;
else if(target<nums[m])
e=m-1;
else
{
re={m,m};
int temp=m;
while(0<=--temp&&nums[temp]==target)
re[0]=temp;
while(++m<nums.size()&&nums[m]==target)
re[1]=m;
return re;
}
}
if(s==e&&nums[s]==target)
re={s,s};
return re;
}
};
时间分析:
这个时间在最坏的情况下**是O(n)**的时间,非常不理想
- 看了leetcode上面的solution,用的是两次的查找,第一次查找最左边的数,第二次寻找最右边的数。用了一个 flag来判断是查询左边还是查询右边。
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> re={-1,-1};
int leftIndex=searchRange(nums, target, true);
if(leftIndex==nums.size()||nums[leftIndex]!=target)
return re;
re[0]=leftIndex;
re[1]=searchRange(nums, target, false)-1;
return re;
}
int searchRange(vector<int>& nums, int target, bool left)
{
int s=0,e=nums.size();
while(s<e)
{
int m=(s+e)/2;
if(target<nums[m]||(left&&nums[m]==target))
e=m;
else
s=m+1;
}
return s;
}
};