给定一个按照升序排列的整数数组 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]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
vector<int> ans;
if (nums.size() == 0) {ans.push_back({-1,-1});;return ans;}
else if (nums.size() == 1&&nums[0]==target) {ans.push_back({0,0});return ans;}
else if (nums.size() == 1&&nums[0]!=target) {ans.push_back({-1,-1});return ans;}
int start, end, mid;
start = 0;
end = nums.size() - 1;
while (start <= end){
mid = (start + end) / 2;
if (nums[mid] == target){
end = mid - 1;
}
else if (nums[mid] > target){ end = mid - 1; }
else if (nums[mid] < target){ start = mid + 1; }
}
if(start== nums.size()) {ans.push_back(-1);}
else{
if(nums[start]!=target){
ans.push_back(-1);
}
else{ans.push_back(start);
}
}
start = 0;
end = nums.size() - 1;
while (start <= end){
mid = (start + end) / 2;
if (nums[mid] == target){
//左侧边界,找到的值在left中,找不到left = end
//end = mid - 1;
//右侧边界
start = mid + 1;
}
else if (nums[mid] > target){ end = mid - 1; }
else if (nums[mid] < target){ start = mid + 1; }
}
if(start-1<0){ans.push_back(-1);}
else{
if(nums[start-1]!=target){
ans.push_back(-1);
}
else{ans.push_back(start-1);}}
return ans;
}
};