给你一个按照非递减顺序排列的整数数组 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]
解法1:
class Solution {
public int[] searchRange(int[] nums, int target) {
if (nums.length == 0) {
return new int[]{-1, -1};
}
int firstPosition = searchFirstPosition(nums, target);
if (firstPosition == -1) {
return new int[]{-1, -1};
}
int lastPosition = searchLastPosition(nums, target);
return new int[]{firstPosition, lastPosition};
}
private int searchFirstPosition(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left < right) {
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
// mid 以及 mid 的左边一定不是目标元素第 1 次出现的位置
left = mid + 1;
} else {
right = mid;
}
}
if (nums[left] == target) {
return left;
}
return -1;
}
private int searchLastPosition(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left < right) {
// mid 被分到右边区间,当搜索区间里只剩下两个元素时,取中间数一定上取整,否则会死循环
int mid = left + (right - left + 1) / 2;
if (nums[mid] > target) {
// mid 以及 mid 的右边一定不是目标元素最后1 次出现的位置
right = mid - 1;
} else {
left = mid;
}
}
return left;
}
}
解法2:
public class Solution {
public int[] searchRange(int[] nums, int target) {
int start = lowerBound(nums, target);
if (start == nums.length || nums[start] != target) {
return new int[] {-1, -1};
}
int end = lowerBound(nums, target + 1) - 1;
return new int[]{start, end};
}
// 闭区间写法 [left,right]
private int lowerBound(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left <= right) {
// 循环不变量:
// nums[left - 1] < target
// nums[right + 1] >= target
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return left;
}
// 左闭右开区间写法 [left,right)
private int lowerBound2(int[] nums, int target) {
int left = 0;
int right = nums.length;
while (left < right) {
// 循环不变量:
// nums[left - 1] < target
// nums[right] >= target
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid + 1;
} else {
right = mid;
}
}
return right;
}
// 左开右闭区间写法 (left,right]
private int lowerBound3(int[] nums, int target) {
int left = -1;
int right = nums.length - 1;
while (left < right) {
// 循环不变量:
// nums[left] < target
// nums[right + 1] >= target
int mid = left + (right - left + 1) / 2;
if (nums[mid] < target) {
left = mid;
} else {
right = mid - 1;
}
}
return right + 1;
}
// 开区间写法 (left,right)
private int lowerBound4(int[] nums, int target) {
int left = -1;
int right = nums.length;
while (left + 1 < right) {
// 循环不变量:
// nums[left] < target
// nums[right] >= target
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left = mid;
} else {
right = mid;
}
}
return right;
}
}
复杂度分析:
时间复杂度:O(logN),执行了两次二分查找,O(2logN)=O(logN),将常数乘法系数视为 1;
空间复杂度:O(1),使用到常数个临时变量。