Search Insert Position (LeetCode)

 Given a sorted array of distinct integers 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 must write an algorithm with O(log n) runtime complexity.

 

Example 1:

Input: nums = [1,3,5,6], target = 5
Output: 2

Example 2:

Input: nums = [1,3,5,6], target = 2
Output: 1

Solution(Java):

class Solution {
    public int searchInsert(int[] nums, int target) {
       int start=0, end=nums.length-1;
        while(start<=end){
            int mid= start+(end-start)/2;
            if(target<nums[mid])
                end=mid-1;
            else if(target>nums[mid])
                start=mid+1;
            else 
                return mid;
        }
        return end+1;
    }
}