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.

Example

[1,3,5,6], 5 → 2

[1,3,5,6], 2 → 1

[1,3,5,6], 7 → 4

[1,3,5,6], 0 → 0

Challenge

O(log(n)) time

Solution

Time:O(log n)

(Search-Insert-Position.py) download

class Solution:
    """
    @param A : a list of integers
    @param target : an integer to be inserted
    @return : an integer
    """
    def searchInsert(self, A, target):
        # write your code here
        if not A:
            return 0
        front = 0
        end = len(A) - 1
        while front<=end:
            mid = (front+end)/2
            if A[mid] == target:
                return mid
            elif A[mid] > target:
                end = mid-1
            else:
                front = mid+1
        return front