34. 在排序数组中查找元素的第一个和最后一个位置
给你一个按照非递减顺序排列的整数数组 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 <= 10^5
-10^9 <= nums[i] <= 10^9
nums 是一个非递减数组
-10^9 <= target <= 10^9
解题
方法:二分搜索
排好序的数组,必是二分搜索
// 时间复杂度: O(logn),空间复杂度: O(1)
class Solution {
// 二分搜索变体
public int[] searchRange(int[] nums, int target) {
int[] result = new int[2];
result[0] = searchLeft(nums, target);
result[1] = searchRight(nums, target);
return result;
}
// 找第一个,在左半部分一直查询
public int searchLeft(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (target > nums[mid]) {
left = mid+1;
} else {
right = mid-1;
}
}
if (left >= nums.length || nums[left] != target) {
return -1;
}
return left;
}
// 找第二个,在右半部分一直查询
public int searchRight(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (target >= nums[mid]) {
left = mid+1;
} else {
right = mid-1;
}
}
if (right < 0 || nums[right] != target) {
return -1;
}
return right;
}
}
如果分辨不清大于小于,就不要想什么大于等于,什么大于,就是等于,就找等于的
public int[] searchRange2(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int first = -1;
int last = -1;
// 找第一个等于target的位置
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] == target) {
first = middle;
right = middle - 1; //重点
} else if (nums[middle] > target) {
right = middle - 1;
} else {
left = middle + 1;
}
}
// 最后一个等于target的位置
left = 0;
right = nums.length - 1;
while (left <= right) {
int middle = (left + right) / 2;
if (nums[middle] == target) {
last = middle;
left = middle + 1; //重点
} else if (nums[middle] > target) {
right = middle - 1;
} else {
left = middle + 1;
}
}
return new int[]{first, last};
}