[LeetCode] Search Insert Position

Search Insert Position

My Submissions

Question

Total Accepted: 79962 Total
Submissions: 222866 Difficulty: Medium

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 class Solution {
public int searchInsert(int[] nums, int target) {
if(nums.length<1)return 0;
int head=0;int tail=nums.length-1;
while(head<tail){
int mid=(head+tail)/2;
if(nums[mid]==target){
return mid;
}
else{
if(head<tail&&nums[mid]>target){
tail=mid-1;
}
else{
if(nums[mid]<target){
head=mid+1;
}
}
}

}
if(nums[head]>=target){
return head;
}
else{
return head+1;
}
}
}