【Python Leetcode】35. Search Insert Position

jessie_31655616

于 2022-07-28 17:11:36 发布

阅读量131

点赞数

分类专栏： python leetcode 文章标签： leetcode 算法数据结构 python

本文链接：https://blog.csdn.net/jessie_31655616/article/details/126039263

版权

python leetcode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

题目

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You must write an algorithm with O(log n) runtime complexity.

Example 1:

Input: nums = [1,3,5,6], target = 5
Output: 2

Example 2:

Input: nums = [1,3,5,6], target = 2
Output: 1

Example 3:

Input: nums = [1,3,5,6], target = 7
Output: 4

Constraints:

1 <= nums.length <= 10⁴
-10⁴ <= nums[i] <= 10⁴
nums contains distinct values sorted in ascending order.
-10⁴ <= target <= 10⁴

思路：二分法

数列已经排好，则可通过比较窗口中点和target的大小来移动与缩小窗口。

特殊情况的处理：

如果搜索过程中遇到被检索的元素与target相等，可以直接插入
可以将最左和最右当作特殊情况处理缩短时间
当窗口左右端相邻时，注意应返回右端index，因为左端一定是小等target

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        
        if target <= nums[0]:
            return 0
        elif target == nums[-1]:
            return len(nums)-1
        elif target > nums[-1]:
            return len(nums)
        
        left = 0
        right = len(nums)-1
        mid = (left + right) / 2
        
        while left <= right:
            mid = (left + right) / 2
            if mid == left:
                return right
            elif nums[left] < target and nums[mid] > target:
                right = mid
            elif nums[mid] < target and nums[right] > target:
                left = mid
            elif nums[mid] == target:
                return mid
            elif nums[left] == target:
                return left
            elif nums[right] == target:
                return right