035_search_insert_position.py

class Solution:
    def searchInsert(self, nums, target):
        l = 0
        r = len(nums) - 1
        while l <= r:
            mid = l + (r - l) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                l = mid + 1
            else:
                r = mid - 1

        return l


if __name__ == '__main__':
    print(Solution().searchInsert([1, 2, 2, 3, 5], 0))