问题描述:给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。你的算法时间复杂度必须是 O(log n) 级别。如果数组中不存在目标值,返回 [-1, -1]。
例:输入: nums = [5,7,7,8,8,10], target = 8;输出: [3,4]
思路:二分查找
二分查找一般分为几种情况:
- 查找某个值
初始化:left = 0; right = nums.length - 1
//因此「搜索区间」是 [left, right]
while (left <= right)
1. nums[mid] == target 时立即返回
2. <情况:left = mid+1
3. >情况:right = mid-1
- 查找左边界
初始化:left = 0; right = nums.length - 1
//因此「搜索区间」是 [left, right)
while (left <= right)
1. <情况:left = mid+1 //收紧左边界,保持左闭右开状态
2. ≥情况:right = mid
注:返回left(=right),最小返回原数组最左边界0
- 查找右边界
初始化:left = 0; right = nums.length
//因此「搜索区间」是 [left, right)
while (left <= right)
1. ≤情况:left = mid+1
2. >情况:right = mid
注:返回left(=right),最大返回nums.length(这是由于到达最右后left会再一次进行更新)
//java
//二分查找
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] num = {-1, -1};
int index = findLeft(nums, 0, nums.length, target, true);
if(index == nums.length || nums[index] != target)//没找到目标值
return num;
num[0] = findLeft(nums, 0, nums.length, target, true);//左边界
num[1] = findLeft(nums, 0, nums.length, target, false) - 1;//右边界
return num;
}
public int findLeft(int[] nums, int left, int right, int target, boolean direct){
while(left < right){
int mid = (left+right) / 2;
if(nums[mid] > target || (direct && nums[mid] == target))//direct表明寻找方向,根据该值动态决定收紧方向。direct为真表明找左边界,此时条件需满足nums[mid] ≥ target; 为假表明查找右边界,此时后面为假,仅需满足nums[mid] > target
right = mid;
else
left = mid + 1;
}
return left;
}
}