LeetCode 35. 搜索插入位置

示例 1:

输入: [1,3,5,6], 5
输出: 2
示例 2:

输入: [1,3,5,6], 2
输出: 1
示例 3:

输入: [1,3,5,6], 7
输出: 4
示例 4:

输入: [1,3,5,6], 0
输出: 0

class Solution:
    def searchInsert(self, nums: [int], target: int) -> int:
        # try:
        #     return nums.index(target)
        # except:
        #     for idx,val in enumerate(nums):
        #         if val > target:
        #             return idx
        # return len(nums)
        #二分法
        length = len(nums)
        if target > nums[-1]: return length
        left = 0
        right = length-1
        while left <= right:
            mid = (right+left)//2
            if nums[mid]>target:
                right = mid - 1
            elif nums[mid]<target:
                left = mid + 1
            else:
                return mid
        return left