leetcode 35. Search Insert Position python

给定一个有序数组和目标值，如果找到目标，则返回索引。 如果没有，按顺序插入后，返回索引

二分法

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