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