- 题目:给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
如果数组中不存在目标值 target,返回 [-1, -1]。
进阶:
你可以设计并实现时间复杂度为 O(log n) 的算法解决此问题吗?
示例:输入:nums = [5,7,7,8,8,10], target = 8
输出:[3,4]
- 由于数组是有序的,通过二分查找找到数组中target的左右边界
要注意要设置left<=right,并且一定要注意边界条件,防止数组越界。
public int[] searchRange(int[] nums, int target){
if (nums.length == 0)
return new int[]{-1, -1};
int leftRes = -1;
int rightRes = -1;
int left = 0;
int right = nums.length - 1;
while (left <= right){
int mid = (left + right) / 2;
if (nums[mid] < target)
left = mid + 1;
else if (nums[mid] > target)
right = mid - 1;
else
right = mid - 1;
}
if (left < nums.length && target == nums[left])
leftRes = left;
left = 0;
right = nums.length - 1;
while (left <= right){
int mid = (left + right) / 2;
if (nums[mid] < target)
left = mid + 1;
else if (nums[mid] > target)
right = mid - 1;
else
left = mid + 1;
}
if (right >= 0 && target == nums[right])
rightRes = right;
return new int[]{leftRes, rightRes};
}