/*
* 二分搜索的一个变种,找到第一个等于target的下标
*/
int binarySearchFirst(vector<int>& nums, int target) {
if (nums.empty()) {
return -1;
}
int left = 0;
int right = nums.size() - 1;
while (left < right) {
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
}
else {
right = mid;
}
}
if (nums[left] == target) {
return left;
}
else {
return -1;
}
}
/*
* 二分搜索的一个变种,找到第一个等于target的下标
*/
int binarySearchLast(vector<int>& nums, int target) {
if (nums.empty()) {
return -1;
}
int left = 0;
int right = nums.size() - 1;
while (left < right) {
int mid = left + (right + 1 - left) / 2;
if (nums[mid] > target) {
right = mid - 1;
}
else {
left = mid;
}
}
if (nums[right] == target) {
return right;
}
else {
return -1;
}
}
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> result;
int first = binarySearchFirst(nums, target);
int last = binarySearchLast(nums, target);
result.push_back(first);
result.push_back(last);
return result;
}