35. 搜索插入位置

轩辕袭智

于 2020-08-04 20:26:52 发布

阅读量92

点赞数

分类专栏： leetcode打卡

本文链接：https://blog.csdn.net/qq_26315647/article/details/107798165

版权

leetcode打卡专栏收录该内容

28 篇文章 0 订阅

订阅专栏

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        self.idx = 0
        self.divide(nums, target, 0, len(nums) - 1)
        return self.idx
    
    def divide(self, nums, target, left, right):


        if left > right:
            self.idx = left 
            return right
        


        
        mid = (left + right) // 2

        
        if nums[mid] < target:
            self.divide(nums, target, mid + 1, right) 
        elif nums[mid] > target:
            self.divide(nums, target, left, mid - 1)
        elif nums[mid] == target:
            self.idx = mid
            return mid