[Lintcode]60. Search Insert Position

60. Search Insert Position

Description

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

我的代码

class Solution:
    """
    @param A: an integer sorted array
    @param target: an integer to be inserted
    @return: An integer
    """
    def searchInsert(self, A, target):
        # write your code here
        if A == []:
            return 0
        l = len(A)
        for i in range(l):
            if A[i]>=target:
                break
        if target<= A[i]:
            return i
        else:
            return i+1

思路：

其实可以用二分法使得时间复杂度为O(log(n))，偷懒了

• 时间复杂度: O(n)
• 出错：又忘了A == []的情况， 而且笔误写错了i和A[i]