题目描述
给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
你的算法时间复杂度必须是 O(log n) 级别。
如果数组中不存在目标值,返回 [-1, -1]。
示例:
输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
参考代码
class Solution {
public:
vector<int> searchRange(vector<int> &data, int k) {
vector<int> res;
res.push_back(getIndexOfFirstK(data, k));
res.push_back(getIndexOfLastK(data, k));
return res;
}
int getIndexOfFirstK(vector<int> data ,int k){
int low = 0;
int high = data.size() - 1;
while(low <= high){
int mid = (low + high) >> 1;
if(data[mid] == k){
if(mid == 0 || data[mid-1] != k)
return mid;
high = mid - 1;
}else if(data[mid] < k){
low = mid + 1;
}else{
high = mid - 1;
}
}
return -1;
}
int getIndexOfLastK(vector<int> data ,int k){
int low = 0;
int high = data.size() - 1;
while(low <= high){
int mid = (low + high) >> 1;
if(data[mid] == k){
if(mid == data.size()-1 || data[mid+1] != k)
return mid;
low = mid + 1;
}else if(data[mid] < k){
low = mid + 1;
}else{
high = mid - 1;
}
}
return -1;
}
};