原题链接:力扣
solution: 利用2次二分即可
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
if(nums.empty()) return{-1,-1};
int l = 0,r = nums.size() - 1;
vector<int> res; //定义返回
while(l < r){ //找到target元素第一个位置
int mid = l + r >> 1;
if(nums[mid] >= target) r = mid;
else l = mid + 1;
}
if(nums[l] != target) return {-1,-1};
else{
res.push_back(l);
l = 0,r = nums.size() - 1;
while(l < r){
int mid = l + r + 1 >> 1;
if(nums[mid] <= target) l = mid;
else r = mid - 1;
}
res.push_back(r);
}
return res;
}
};