给定一个按照升序排列的整数数组 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> res(2,-1);
int numsLen = nums.size();
if (numsLen == 0) {
return res;
} else if (numsLen == 1) {
if (target == nums[0]) {
res[0] = 0;
res[1] = 0;
return res;
}
}
int leftP = 0;
int rightP = numsLen - 1;
int mid = 0;
bool findTargetInFirstLoop = false;
while (leftP <= rightP) {
mid = leftP + (rightP - leftP) / 2;
if (nums[mid] > target) {
rightP = mid - 1;
} else if (nums[mid] < target) {
leftP = mid + 1;
} else {
findTargetInFirstLoop = true;
break;
}
}
if (findTargetInFirstLoop) {
int leftP1 = leftP;
int rightP1 = mid;
int leftP2 = mid;
int rightP2 = rightP;
int mid1;
int mid2;
//分两个区间查找上界和下界
while (leftP1 <= rightP1) {
mid1 = leftP1 + (rightP1 - leftP1) / 2;
if (nums[mid1] < target) {
leftP1 = mid1 + 1;
} else {
if ((mid1 > 0 && nums[mid1 - 1] != target) || mid1 == 0) {
res[0] = mid1;
break;
}
rightP1 = mid1 - 1;
}
}
while (leftP2 <= rightP2) {
mid2 = leftP2 + (rightP2 - leftP2) / 2;
if (nums[mid2] > target) {
rightP2 = mid2 - 1;
} else {
if ((mid2 < numsLen - 1 && nums[mid2 + 1] != target) || mid2 == numsLen - 1) {
res[1] = mid2;
break;
}
leftP2 = mid2 + 1;
}
}
}
return res;
}
};