35. 搜索插入位置

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums) - 1
        self.idx = 0
        self.divide(nums, left, right,target)
        return self.idx
    
    def divide(self, nums, left, right, target):
        #不存在
        if left > right:
            self.idx = right + 1
            return
        mid =(left + right) // 2
        if nums[mid] == target:
            self.idx = mid
            return 
        elif nums[mid] > target:
            self.divide(nums, left, mid - 1 , target)
        else: 
            self.divide(nums, mid + 1, right, target)