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 int searchInsert(int[] nums, int target) {
if(nums.length==0) return 0;
int start = 0;
int end = nums.length-1;
int loc = findLoction(start,end,nums,target);
return loc;
}
public int findLoction(int start, int end, int[] nums, int target) {
if(start<end){
int mid = (start+end)/2;
if(target==nums[mid])
return mid;
else if(target>nums[mid])
return findLoction(mid+1,end,nums,target);
else
return findLoction(start,mid,nums,target);
}
else if(start==end){
if(target==nums[start])
return start;
else if(target>nums[start])
return start+1;
else
return start;
}
else return 0;
}