leetcode 35 搜索插入位置

1.常规解法遍历数组

def searchInsert(nums, target):
    for i in range(len(nums)):
        for i in range(len(nums)):
            if nums[i] == target:
                return i
            elif nums[i] > target:
                return i

    return len(nums)

2.二分查找

def searchInsert(nums, target):
    ###二分查找
    low,high = 0,len(nums)-1
    while  low <= high:
        mid = int((low + high) / 2)
        if nums[mid] == target:
            return mid
        if nums[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return low