leetcode_35. 搜索插入位置

题目

leetcode题目链接

思路分析

题目要求：找出目标元素在有序数组中插入位置
折半查找

代码展示

class Solution:
    def searchInsert(self, nums, target: int) -> int:
        left = 0
        right = len(nums)-1
        mid = (left+right)//2
        while left<=right:
            mid = (left+right)//2
            if nums[mid] == target:
                break
            elif nums[mid] < target:
                left = mid+1
            else:
                right = mid-1
        #找到当前元素
        if nums[mid]==target:
            return mid
        #没找到当前元素
        else:
            return right+1

if __name__ == "__main__":
    
    a = Solution()
    print(a.searchInsert([1,3,5,6], 2))