给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
你的算法时间复杂度必须是 O(log n) 级别。
如果数组中不存在目标值,返回 [-1, -1]。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]
方法1:
public int[] searchRange(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while(left <= right) {
int mid = (left + right) / 2;
if(nums[mid] == target) {
int start = mid, end = mid;
while(start >= left && nums[start] == target)
start --;
while(end <= right && nums[end] == target)
end ++;
return new int[]{start + 1, end - 1};
}else if(nums[mid] < target)
left = mid + 1;
else
right = mid - 1;
}
return new int[]{-1, -1};
}
这种线性搜索可能不满足时间复杂度的要求。
方法2:
public int[] searchRange(int[] nums, int target) {
if(nums.length == 0)
return new int[]{-1, -1};
return new int[]{left_bound(nums, target), right_bound(nums, target)};
}
int right_bound(int[] nums, int target) {
int left = 0, right = nums.length;
while(left < right) {
int mid = (left + right) / 2;
if(nums[mid] == target)
left = mid + 1;
else if(nums[mid] < target)
left = mid + 1;
else if(nums[mid] > target)
right = mid;
}
if(left >= 1 && nums[left-1] == target)
return left-1;
return -1;
}
int left_bound(int[] nums, int target) {
int left = 0, right = nums.length;
while(left < right) {
int mid = (left + right) / 2;
if(nums[mid] == target)
right = mid;
else if(nums[mid] < target)
left = mid + 1;
else if(nums[mid] > target)
right = mid;
}
if(left < nums.length && nums[left] == target)
return left;
return -1;
}