35. 搜索插入位置

算法-目录
题目来源：Leetcode 35. 搜索插入位置

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