题目
给定一个按照升序排列的整数数组 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]
解题思路
详细思路请参考 (面试题53 - I)在排序数组中查找数字 I
代码
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] res = new int[]{-1, -1};
if(nums.length==0){
return res;
}
int first = getFirst(nums, target, 0, nums.length-1);
int last = getLast(nums, target, 0, nums.length-1);
res[0] = first;
res[1] = last;
return res;
}
private int getFirst(int[] nums, int target, int start, int end){
while(start<=end){
int mid = start + (end-start)/2;
if(nums[mid]==target){
if(mid==0 || (nums[mid-1] != target)){
return mid;
}else{
end = mid-1;
}
}else if(nums[mid]<target){
start = mid+1;
}else{
end = mid-1;
}
}
return -1;
}
private int getLast(int[] nums, int target, int start, int end){
while(start<=end){
int mid = start + (end-start)/2;
if(nums[mid]==target){
if(mid==nums.length-1 || (nums[mid+1] != target)){
return mid;
}else{
start = mid+1;
}
}else if(nums[mid]<target){
start = mid+1;
}else{
end = mid-1;
}
}
return -1;
}
}