Given a sorted array and a target value, return the index if the target is found. If not, return the index
where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
public static int solution_7_2(int[] nums,int target){
return findIndex(nums,0,nums.length-1,target);
}
private static int findIndex(int[] nums,int low,int high,int target){
if(low==high){
if(nums[low]==target)
return low;
if(nums[low]<target)
return low+1;
if(nums[low]>target)
return low;
}
if(low<high){
int mid=(low+high)/2;
if(nums[mid]==target)
return mid;
if(nums[mid]>target)
return findIndex(nums, low, mid-1, target);
if(nums[mid]<target)
return findIndex(nums, mid+1, high, target);
}
return -1;
}