35. Search Insert Position

35. Search Insert Position

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

Hide Tags

 Array Binary Search

Hide Similar Problems

 (E) First Bad Version

 

public class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        //find the first number that is >= than target
        if(nums[right] < target)
            return right+1;
            
        while(left<right){
            int mid = (left+right)/2;
            if(nums[mid] == target)
                return mid;
            if(nums[mid] > target)
                right = mid;
            else
                left = mid + 1;
        }
        
        return left;
    }
}