题目描述:给你一个按照非递减顺序排列的整数数组 nums,和一个目标值 target。请你找出给定目标值在数组中的开始位置和结束位置。如果数组中不存在目标值 target,返回 [-1, -1],设计并实现时间复杂度为 O(log n) 的算法解决此问题。
获得更多?算法思路:代码文档,算法解析的私得。
完整代码
/**
* 2 * @Author: LJJ
* 3 * @Date: 2023/7/21 11:27
* 4
*/`在这里插入代码片`
public class SearchRange {
public int[] searchRange(int[] nums , int target){
int[] result = new int[] {-1,-1};
int left = 0, right = nums.length - 1;
//第一次二分查找 目标值开始位置
while (left<=right){
int mid = left +(right - left) /2;
if (nums[mid] == target){
result[0] = mid;
right = mid - 1; //继续向左查找
}else if (nums[mid] < target){
left = mid +1;
}else {
right = mid -1;
}
}
// 第二次二分查找 目标值结束位置
left = 0;
right = nums.length -1;
while (left <= right){
int mid = left + (right - left)/2;
if (nums[mid] == target){
result[1] = mid;
left = mid +1 ;// 继续向右查找
}else if (nums[mid] < target){
left = mid +1 ;
}else {
right = mid -1 ;
}
}
return result;
}
public static void main(String[] args) {
SearchRange searchRange = new SearchRange();
int[] nums = {1, 2, 3, 5, 7, 7, 8, 8, 10};
int target = 7;
int[] result = searchRange.searchRange(nums, target);
System.out.println("Start and end positions of target in the array: [" + result[0] + ", " + result[1] + "]");
}
}