题目如下:
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].
翻译过来题意如下:
给定一个排好序的数组,然后给定一个数,在该有序数组中进行查找,如果找到就返回第一个出现的下标和最后一次出现的下标;否则返回[-1, -1].要求算法的时间的复杂度必须为O(lgn).
例如对于数组[5, 7, 7, 8, 8, 10],要查找的数为8,则返回[3, 4].
查找11的话,返回[-1, -1].
如果没有要求时间复杂度为O(lgn)的话,可以顺序查找,找到第一个出现的下标和最后一次出现的下标,时间复杂度为O(n)。
考虑到数组为有序数组,因此可以使用二分查找,第一次调用二分查找,先找到第一次出现的下标,然后再调用二分查找,找到最后一次出现的下标。
代码如下:
class Solution {
public:
vector<int> searchRange(vector<int> &nums, int target) {
vector<int> result(2, -1);
if(nums.size() == 0)
return result;
if(target < nums[0] || target > nums[nums.size() - 1])
return result;
result[0] = searchLowerPosi(nums, 0, nums.size() - 1, target);
result[1] = searchUpperPosi(nums, 0, nums.size() - 1, target);
return result;
}
private:
int searchLowerPosi(vector<int> &nums, int low, int up, const int target) {
if(low > up) return -1;
if(low == up && nums[low] == target)
return low;
if(low == up && nums[low] != target)
return -1;
int middle = (low + up) >> 1;
if(nums[middle] == target) {
int lower_posi = searchLowerPosi(nums, low, middle - 1, target);
if(lower_posi == -1) return middle;
else return lower_posi;
}
else if(nums[middle] > target)
return searchLowerPosi(nums, low, middle - 1, target);
else return searchLowerPosi(nums, middle + 1, up, target);
}
int searchUpperPosi(vector<int> &nums, int low, int up, const int target) {
if(low > up) return -1;
if(low == up && nums[low] == target)
return low;
if(low == up && nums[low] != target)
return -1;
int middle = (low + up) >> 1;
if(nums[middle] == target) {
int upper_posi = searchUpperPosi(nums, middle + 1, up, target);
if(upper_posi == -1) return middle;
else return upper_posi;
}
else if(nums[middle] > target)
return searchUpperPosi(nums, low, middle - 1, target);
else return searchUpperPosi(nums, middle + 1, up, target);
}
};