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

Solution

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        l, r = 0, len(nums) - 1
        while l  < r:
            mid = (l + r) / 2
            if nums[mid] == target:
                return mid
            if nums[mid] > target:
                r = mid
            else:
                l = mid + 1
        return l + 1 if target > nums[l] else l

public class Solution {
    public int searchInsert(int[] nums, int target) {



        int l = 0, r = nums.length - 1;

        while(l < r) {
            int mid = (l + r) / 2;

            if(nums[mid] == target)
                return mid;
            else if(nums[mid] > target)
                r = mid;
            else
                l = mid + 1;
        }

        return target > nums[l] ? l + 1 : l;
    }
}