Embedded Files
35. Search Insert Position
Easy
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
class Solution {
public int searchInsert(int[] nums, int target) {
//Base condition
if(target < nums[0]) {
return 0;
}
else if(target > nums[nums.length-1]) {
return nums.length;
}
int index = binarySearch(0, nums.length, target, nums);
return index;
}
public int binarySearch(int s, int e, int target, int[] arr) {
int mid = s + (e-s)/2;
if(arr[mid] == target) {
return mid;
}
else if(mid-1 >= 0 && arr[mid] > target && arr[mid-1] < target) {
return mid;
}
else if(arr[mid] > target) {
return binarySearch(s, mid-1, target, arr);
}
else {
return binarySearch(mid+1, e, target, arr);
}
}
}
Page updated
Report abuse