Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm’s runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1].
For example, Given [5, 7, 7, 8, 8, 10] and target value 8, return [3, 4].
public static void solution_7_1(int[] nums,int target){
int[] res=new int[2];
res[0]=findTarget(nums,0,nums.length-1,target,true);
res[1]=findTarget(nums,0,nums.length-1,target,false);
System.out.println(res[0]+" "+res[1]);
}
private static int findTarget(int[] nums,int low,int high,int target,boolean left){
if(low>high)
return -1;
else{
int mid=(low+high)/2;
if(nums[mid]==target){
if(left==true){
if(mid==0||nums[mid-1]<nums[mid])
return mid;
else{
return findTarget(nums, low, mid-1, target, left);
}
}else{
if(mid==nums.length-1||nums[mid+1]>nums[mid])
return mid;
else{
return findTarget(nums,mid+1,high,target,left);
}
}
}
else{
if(nums[mid]>target)
return findTarget(nums, low, mid-1, target, left);
else
return findTarget(nums, mid+1, high, target, left);
}
}
}