给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
如果数组中不存在目标值 target,返回 [-1, -1]。
进阶:
你可以设计并实现时间复杂度为 O(log n) 的算法解决此问题吗?
示例 1:
输入:nums = [5,7,7,8,8,10], target = 8
输出:[3,4]
示例 2:
输入:nums = [5,7,7,8,8,10], target = 6
输出:[-1,-1]
示例 3:
输入:nums = [], target = 0
输出:[-1,-1]
提示:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums 是一个非递减数组
-109 <= target <= 109
来源:力扣(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) {
int leftBoundary = findLeftBoundary(nums,target);
int rightBoundary = findRightBoundary(nums,target);
if(leftBoundary == -2 || rightBoundary == -2){
vector<int> res = {-1,-1};
return res;
}
vector<int> res = {leftBoundary,rightBoundary};
return res;
}
int findLeftBoundary(vector<int>& nums, int target){
int left = 0, right = nums.size() - 1, mid, res = -2;
while(left <= right){
mid = left + (right - left) / 2;
if(nums[mid]<target){
left = mid + 1;
}
else if(nums[mid]>target){
right = mid - 1;
}
else{
res = mid;//先记录,再左移
right = mid - 1;
}
}
return res;
}
int findRightBoundary(vector<int>& nums, int target){
int left = 0, right = nums.size() - 1, mid, res = -2;
while(left <= right){
mid = left + (right - left) / 2;
if(nums[mid]<target){
left = mid + 1;
}
else if(nums[mid]>target){
right = mid - 1;
}
else{
res = mid;//先记录,再左移
left = mid + 1;
}
}
return res;
}
};
KeyPoint:
1. 所有二分问题统一一个模板
left<=right,left=mid+1,right=mid-1
2. 分别查找左右边界
框架不变,如查左边界,每当找到一个和target相等的元素则记录当前位置,并right=mid-1,左移一个,直到while被打破,所res记录的最后一次位置即为左边界;右边界同理,left=mid+1