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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
public int searchInsert(int[] nums, int target) {
/*int tmp = nums.length;
for(int i=0; i<nums.length; i++){
if(target <= nums[i]){
tmp = i;
return tmp;
}
}
return tmp;*/
return binarySearch(nums,target,0,nums.length-1);
}
public int binarySearch(int[] nums, int target, int start, int end){
if(start>end){
return start;
}
int middle = (start+end)/2;
if(target == nums[middle]){
return middle;
}else if(target < nums[middle]){
return binarySearch(nums,target,start,middle-1);
}else {
return binarySearch(nums,target,middle+1,nums.length-1);
}
}