30 leetcode - Search Insert Position

最新推荐文章于 2025-08-16 00:47:01 发布

忧桑的小兔子

最新推荐文章于 2025-08-16 00:47:01 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode 有序数组插数寻找插入位置算法

本文链接：https://blog.youkuaiyun.com/lis_12/article/details/53522965

算法专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个用于在已排序数组中查找目标值插入位置的算法。该算法采用二分查找法，返回目标值若存在时的位置索引，或不存在时应插入的位置索引。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
题目:Search Insert Position
Given a sorted array 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.
举例:
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
[1,3,3,3,3,5] 3 -> 1
寻找符合要求最小的index
'''
class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        length = len(nums)
        if length == 0:
            return -1

        left,right = 0,length - 1
        index = 0

        while left <= right:
            index = (left + right)>>1
            val = nums[index]
            if val == target:
                if index > 0 and nums[index - 1] == target:
                    right = index - 1
                else:
                    return index
            elif val > target:
                right = index - 1
            else:
                left = index + 1

        return index if nums[index] > target else index + 1

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