0035 - Search Insert Position

0035 - Search Insert Position

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. (This means binary search)

Examples:

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

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

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

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

Input: nums = [1], target = 0 Output: 0

Constraints:

1 <= nums.length <= 104 -104 <= nums[i] <= 104 nums contains distinct values sorted in ascending order. -104 <= target <= 104

Java Solution

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