1. 思路
标准的二分查找模板,查找左边界和右边界
2.代码
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int l, r;
vector<int> ret;
l = 0; r = nums.size() - 1;
while(l <= r)
{
int mid = (l + r) >> 1;
if(nums[mid] >= target) r = mid - 1;
else l = mid + 1;
}
ret.push_back((l < nums.size() && nums[l] == target) ? l : -1);
l = 0; r = nums.size() - 1;
while(l <= r)
{
int mid = (l + r) >> 1;
if(nums[mid] <= target) l = mid + 1;
else r = mid - 1;
}
ret.push_back((r >= 0 && nums[r] == target) ? r : -1);
return ret;
}
};