LintCode 60题：Search Insert Position

这篇文章讲解的是LintCode第60题：在有序数组中查找插入位置—Search Insert Position

题目描述链接

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

也是二分法模板，但是需要找到第一个大于等于target的索引值：

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 not A:
            return 0
            
        start, end = 0, len(A) - 1
        while start + 1 < end:
            mid = start + (end - start) // 2
            if A[mid] == target:
                return mid
            elif A[mid] < target:
                start = mid
            else:
                end = mid
        if A[start] >= target:
            return start
        if A[end] >= target:
            return end
        return end + 1